Let us begin with Deterministic Finite Automata (FA) Examples with a transition table and detailed explanation.
The given DFA is for the Regular expression of (bb)*(aa)*.
- 2 Accepted strings of length 1= {No String Exist}
- 2 Accepted strings of length 2= {bb, aa}
- 2 Accepted strings of length 5= {No String Exist}
- 2 Accepted strings of length 8= {bbbbaaaa, bbbbbbbb, …. and many more similar strings.}
- 2 Accepted strings of length 10= {bbbbbbaaaa, bbaaaaaaaa, …. and many more similar strings.}
- 2 Accepted strings of length 15= {No String Exist}
- 2 Accepted strings of length 20= {bbbbbbbbbbbbbbbbaaaa, bbbbbbbbbbaaaaaaaaaa, …. and many more similar strings. }
- 2 Accepted strings of length 25= {No String Exist}
- and many more similar strings
How to read bb?
0 to 3 | 3 to 0
How to read aa?
0 to 2 | 2 to 1
How to read bbbbaaaa?
0 to 3 | 3 to 0 |0 to 3 |3 to 0| 0 to 2 | 2 to 1| 1 to 2 | 2 to 1
How to read bbbbbbbb?
0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0
How to read bbbbbbaaaa?
0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 2 | 2 to 1| 1 to 2 | 2 to 1
How to read bbaaaaaaaa?
0 to 3 | 3 to 0 | 0 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 bbbbbbbbbbbbbbbbaaaa?
0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 |0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 2 | 2 to 1| 1 to 2 | 2 to 1
How to read bbbbbbbbbbaaaaaaaaaa?
0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 | 0 to 3 | 3 to 0 |0 to 3 | 3 to 0 | 0 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 2 | 2 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.