How can I construct finite automata accepting the following language?
NFA : The set of strings over $\{a, b\}$ in which every $a$ is followed by $b$ or $ab$.
How can I construct finite automata accepting the following language?
NFA : The set of strings over $\{a, b\}$ in which every $a$ is followed by $b$ or $ab$.
In your attempt your automata accepts $a\notin \mathcal L$ so it is not correct.
The words that the automata should accept are $b,bb,bb,ab,aab,bbbabbbaabbb,\dots$
I think that this should work: