By: Prof. Dr. Fazal Rehman | Last updated: December 28, 2023
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 readabbbbbbbbbbbbbb?
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 readbbaaaaaaaaaaaaa?
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 readbbaaaaaaaaaaaaaaaaaa?
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 readabbbbbbbbbbbbbbbbbbbbbbbb?
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 readbbaaaaaaaaaaaaaaaaaaaaaaa?
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.