This is a continuation of the tutorial of FA (Automata) exercises and examples. Let us see the DFA of Regular Expression of a(a+b)b*+bb(a)*.
Strings of FA (Automata)
- 2 Accepted strings of length 1={no string}
- 2 Accepted strings of length 2={ aa, bb, ab, no more strings}
- 2 Accepted strings of length 5={aabbb, bbaaa, and many more possible strings }
- 2 Accepted strings of length 8={abbbbbbb, bbaaaaaa, and many more possible strings }
- 2 Accepted strings of length 10={ aabbbbbbbb, bbaaaaaaaa , and many more similar strings }
- 2 Accepted strings of length 15={abbbbbbbbbbbbbb, bbaaaaaaaaaaaaa, and many more similar strings }
- 2 Accepted strings of length 20={ aabbbbbbbbbbbbbbbbbb, bbaaaaaaaaaaaaaaaaaa, and many more similar strings }
- 2 Accepted strings of length 25={ abbbbbbbbbbbbbbbbbbbbbbbb, bbaaaaaaaaaaaaaaaaaaaaaaa, and many more similar strings }
How to read strings from FA (Automata)?
How to read aa?
0 to 4| 4 to 2|
How to read bb ?
0 to 3| 3 to 1|
How to read aabbb?
0 to 4| 4 to 2| 2 to 2| 2 to 2| 2 to 2|
How to read bbaaa ?
0 to 3| 3 to 1| 1 to 1| 1 to 1| 1 to 1|
How to read abbbbbbb ?
0 to 4| 4 to 2| 2 to 2| 2 to 2| 2 to 2|2 to 2|2 to 2|2 to 2|
How to read bbaaaaaa ?
0 to 3| 3 to 1| 1 to 1| 1 to 1| 1 to 1| 1 to 1| 1 to 1| 1 to 1|
How to read aabbbbbbbb?
0 to 4 | 4 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 |
How to read bbaaaaaaaa?
0 to 3| 3 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 abbbbbbbbbbbbbb?
0 to 4| 4 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 2|2 to 2|2 to 2|2 to 2|2 to 2|
How to read bbaaaaaaaaaaaaa?
0 to 3| 3 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 aabbbbbbbbbbbbbbbbbb?
0 to 4| 4 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 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 2|
How to read bbaaaaaaaaaaaaaaaaaa?
0 to 3| 3 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 abbbbbbbbbbbbbbbbbbbbbbbb?
0 to 4| 4 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 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 2| 2 to 2| 2 to 2| 2 to 2| 2 to 2| 2 to 2|
How to read bbaaaaaaaaaaaaaaaaaaaaaaa?
0 to 3| 3 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|
Video Lecture
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.