Finite Automata Exercise

Finite Automata in theory-of-automata.

Finite Automata Exercise Solution

Here I am showing you a list of some more important Deterministic Finite Automata used in the theory of automata and theory of computation.

  1. DFA for  (a+b)* (a+b)a .
  2. DFA for (bb)*(aa)* .
  3. DFA for  b+a(a+b)*+a.
  4. DFA for (a+b)*b+(bb)*a.
  5. DFA for bb+a(a+b)*+aa.
  6. DFA for  a(a+b)*+bb(a)* .
  7. DFA for  a(a+b)b*+bb(a)*.
  8. DFA for  b(aa)*a+a(bb)*b.
  9. DFA for a+a(aa+b)*(aa)b.
  10. DFA for a+a(aa+b)*+(aa)b.
  11. DFA for (a+b)b(a+b)*+(aa)*b.
  12. FA for strings starting with a and ending with a.
  13. FA for the language of all those strings starting with a.
  14. FA for the language of all those strings containing aa as a substring.
  15. DFA for the language of all those strings starting and ending with the same letters.
  16. DFA for the language of all those strings starting and ending with different letters.
  17. DFA for the language of all those strings having double 0 or double 1.
  18. DFA for the language of all those strings starting and ending with b.
  19. DFA for ending with b.
  20. DFA for the string of even A’s and even b’s.
  21. DFA for the regular expression of  a(a+b)*+(bb)+a(ba)*+aba+bb*(a+b)*.
  22. RegExp and DFA for strings having triple a’s or triple b’s.
  23. Finite Automata of all strings divisible by 4
  24. Finite automata for all strings with at least one a
  25. Finite automata for all strings with at least two a
  26. Finite automata for all strings with exactly two b
  27. Finite automata for at least one a and at least one b
  28. Finite automata for strings end in a double letter (two a’s or two b’s)
  29. Finite Automata for All strings containing exactly one a

More Examples in the next page

Video Lecture