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
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.
- DFA for (a+b)* (a+b)a .
- DFA for (bb)*(aa)* .
- DFA for b+a(a+b)*+a.
- DFA for (a+b)*b+(bb)*a.
- DFA for bb+a(a+b)*+aa.
- DFA for a(a+b)*+bb(a)* .
- DFA for a(a+b)b*+bb(a)*.
- DFA for b(aa)*a+a(bb)*b.
- DFA for a+a(aa+b)*(aa)b.
- DFA for a+a(aa+b)*+(aa)b.
- DFA for (a+b)b(a+b)*+(aa)*b.
- FA for strings starting with a and ending with a.
- FA for the language of all those strings starting with a.
- FA for the language of all those strings containing aa as a substring.
- DFA for the language of all those strings starting and ending with the same letters.
- DFA for the language of all those strings starting and ending with different letters.
- DFA for the language of all those strings having double 0 or double 1.
- DFA for the language of all those strings starting and ending with b.
- DFA for ending with b.
- DFA for the string of even A’s and even b’s.
- DFA for the regular expression of a(a+b)*+(bb)+a(ba)*+aba+bb*(a+b)*.
- RegExp and DFA for strings having triple a’s or triple b’s.