DFA automata

Let us see the DFA of Regular Expression a(a+b)*+bb(a)*.

DFA automata

Explanation of DFA

  • 2 Accepted strings of length 1={a, no more possible strings}
  • 4 Accepted strings of length 2={aa, bb, ab, no more possible strings}
  • 2 Accepted strings of length 5={aaaaa, bbaaa, …. and many more similar strings }
  • 2 Accepted strings of length 8={aabbaabb, bbaaaaaa, … and many more similar strings }
  • 2 Accepted strings of length 10={aaaaaaaaaa, bbaaaaaaaa, …. and many more similar strings }
  • 2 Accepted strings of length 15={aabbbbaaabbbabb,bbaaaaaaaaaaaaa, …. and many more similar strings }
  • 2 Accepted strings of length 20={aaaaabbbbbbbbbbaaaaa,bbaaaaaaaaaaaaaaaaaa, …. and many more similar strings }
  • 2 Accepted strings of length 25={aaaaaaaaaaaabbbbbbbbbbbbb, bbaaaaaaaaaaaaaaaaaaaaaaa, …. and many more similar strings }
  • and many more similar strings

How to read strings from DFA?

How to read a?

0 to 2

How to read aa?

0 to 2 |2 to 2 |

How to read bb?

0 to 3 |3 to 1

How to read aaaaa?

0 to 2 |2 to 2 |2 to 2 | 2 to 2 | 2 to 2

How to read bbaaa?

0 to 3 |3 to 1 | 1 to 1| 1 to 1| 1 to 1

How to read aabbaabb?

0 to 2 |2 to 2 | 2 to 2| 2 to 2| 2 to 2| 2 to 2| 2 to 2|2 to 2

How to read bbaaaaaa?

0 to 3 |3 to 1 | 1 to 1| 1 to 1| 1 to 1| 1 to 1| 1 to 1|1 to 1

How to read aaaaaaaaaa?

0 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2

How to read bbaaaaaaaa?

0 to 3 |3 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1

How to read aabbbbaaabbbabb?

0 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2

How to read bbaaaaaaaaaaaaa?

0 to 3 |3 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1

How to read aaaaabbbbbbbbbbaaaaa?

0 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2

How to read bbaaaaaaaaaaaaaaaaaa?

0 to 3 |3 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1

How to read aaaaaaaaaaaabbbbbbbbbbbbb?

0 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2 |2 to 2

How to read bbaaaaaaaaaaaaaaaaaaaaaaa?

0 to 3 |3 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1 |1 to 1

List of 100+ Important Deterministic Finite Automata

fyp ideas main page

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.

Related Posts: