Theory-of-computation DFA

Question

Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}

Answer 1

The complement of given language L will be L' = every a is immediately followed by b and we can draw dfa for L'.

Picture 1 is for L' and picture 2 is for L(original language).

Complementing a dfa for a language will give dfa for the complement of of that language.

So complement of language L is L', we can draw dfa for L' and complementing dfa for L' will give us dfa for L.

Please correct me if i am wrong.

Comments

Unable to upload the pictures, :(

---

I got...

Thanks

---

I think it should be min dfa,correct me if I m wrong