Deterministic finite state machine Excercise solutions

Let us see the Deterministic finite state machine Exercises solutions. In this tutorial, we will draw a DFA for the Regular Expression of (a+b)*b+(bb)*a.

Explanation of Strings of the langugage

• 2 Accepted strings of length 1 = {b,a no more possible string}
• 2 Accepted strings of length 2 = {ab , bb, … and many more similar strings }
• 2 Accepted strings of length 5 = {aaabb, bbbba,… and many more similar strings}
• 2 Accepted strings of length 8 = {aabbabab, bababbab, … and many more similar strings }
• 2 Accepted strings of length 10 = {aaaaababab , ababababab , … and many more similar strings }
• 2 Accepted strings of length 15 = { aaaaabbaababaab, bbbbbbbbbbbbbba , … and many more similar strings }
• 2 Accepted strings of length 20 = { aaaabbbbbbababababbb , abbbbbaaaabbabbaabab , … and many more similar strings }
• 2 Accepted strings of length 25 = { aaaaaaaaaabbbbbbaaaaaaaab , bbbbbbbbbbbbbbbbbbbbbbbba , … and many more similar strings }
• and many more similar strings

0 to 3

0 to 1

0 to 1 |  0 to 3

0 to 3 | 3 to 4

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

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

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

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

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

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

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

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

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

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

0to 1 | 1 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 1| 1 to  1| 1 to 1 | 1 to 1 |  1 to 1 | 1 to 1 | 1 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 1|

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

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.