Finite automata NFA

232 Views Asked by At

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$.

My try

1

There are 1 best solutions below

4
On BEST ANSWER

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: enter image description here