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|
Video Lecture
List of 100+ Important Deterministic Finite Automata
I welcome to all of you if you want to discuss about any topic. Researchers, teachers and students are allowed to use the content for non commercial offline purpose. Further, You must use the reference of the website, if you want to use the partial content for research purpose.
- List of Public service commissions - August 31, 2020
- Comparison of fee structure of Pakistani Universities - June 1, 2020
- Past Guess Paper of Auditing - May 12, 2020