Let us see the DFA Exercises and Solutions. In this example, we are going to read a detailed description of the Deterministic finite automata for the regular expression of b+a(a+b)*+a.
- 2 Accepted strings of length 1={ b, a, no more strings }
- 2 Accepted strings of length 2={ab, aa, … and many more similar strings }
- 2 Accepted strings of length 5={ abaab, aaabb, … and many more similar strings}
- 2 Accepted strings of length 8={abbbbaaa, aaabbbaa, … and many more similar strings }
- 2 Accepted strings of length 10={ abbbbaaaba, aaabbbaabb, … and many more similar strings }
- 2 Accepted strings of length 15={ aaabbbaabbaaaba, abbbbbbbaaaabbb, … and many more similar strings }
- 2 Accepted strings of length 20={aaaaabbbbbaaaaababab, abbbbbaaaabaaaabbbba, … and many more strings}
- 2 Accepted strings of length 25={abbaabbbaaabbaabbbbbaaaaa, abbbbbbbbbbbaaaaaaaabbbbb, … and many more strings }
- and many more similar strings
How to read b ?
0 to 2
How to read a?
0 to 1
How to read ab?
0 to 1 | 1 to 1 |
How to read aa?
0 to 1 | 0 to 1 |
How to read abaab?
0 to 1 |1 to 1 | 1 to 1 | 1 to 1 | 1 to 1 |
How to read aaabb?
0 to 1 |1 to 1 | 1 to 1| 1 to 1| 1 to 1 |
How to read abbbbaaa?
0 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 aaabbbaa?
0 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 abbbbaaaba?
0 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 aaabbbaabb?
0 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 aaabbbaabbaaaba?
0 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 aaaaabbbbbaaaaababab?
0 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|
How to read abbbbbaaaabaaaabbbba?
0 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|
How to read abbaabbbaaabbaabbbbbaaaaa?
0 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| 1 to 1|
How to read abbbbbbbbbbbaaaaaaaabbbbb?
0 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| 1 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.
