Site icon T4Tutorials.com

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

How to read b?

0 to 3

How to read a?

0 to 1

How to read ab?

0 to 1 |  0 to 3

How to read bb?

0 to 3 | 3 to 4

How to read aaabb ?

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

How to read bbbba ?

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

How to read aabbabab?

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

How to read bababbab?

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

How to read aaaaababab?

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  |

How to read ababababab?

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  |

How to read aaaaabbaababaab?

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  |

How to read bbbbbbbbbbbbbba?

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 |

How to read aaaabbbbbbababababbb?

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 |

How to read abbbbbaaaabbabbaabab ?

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  |

How to read aaaaaaaaaabbbbbbaaaaaaaab?

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|

How to read bbbbbbbbbbbbbbbbbbbbbbbba?

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 |

List of 100+ Important Deterministic Finite 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.
Exit mobile version