Let’s see an example of DFA Language.
Regular Expression
a+a(aa+b)*+(aa)b
Strings of FA (Automata)
- 2 accepted strings of length 1= { a, no more strings exist.}
- 2 accepted strings of length 2= {ab, no more string}
- 2 accepted strings of length 3= {aaa,abb, aab, no more string }
- 2 accepted strings of length 5= {aaabb,abaab, …. and many more similar strings}
- 2 accepted strings of length 8= {aaabbbaa, abbaabaa, …. and many more similar strings }
- 2 accepted strings of length 10={aaabaabaab, aabbbaaabb, …. and many more similar strings }
- 2 accepted strings of length 15={aaabbbbbaaaaabb, aaabbbbbbaaaabb, …. and many more similar strings }
- 2 accepted strings of length 20={abbbbbbbbbbbaaaabaab, aaabbbaabbaabbbbbbaaa, …. and many more similar strings }
- 2 accepted strings of length 25={aaabbbaaaabbbbaaaabbbbbba, abbbbbbbbbbaaaaaabbbaa, …. and many more similar strings }
- 2 accepted strings of length 30= {aaabbaaaaaaaabbbbbbbaaaabbbbbb…. and many more similar strings }
- and many more similar strings.
How to read strings from FA?
How to read { a}?
|0 to 4|
How to read {ab}?
|0 to 4| 4 to 2|
How to read {aaa }?
|0 to 4|4 to 5|5 to 2|
How to read { aab}?
|0 to 4| 4 to 5|5 to
How to read { abaab}?
|0 to 4| 4 to 2|2 to 3|3 to 2|2 to 2|
How to read {aaabb }?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|
How to read { abbaabaa}?
|0 to 4|4 to 2|2 to 2|2 to 3|3 to 2|2 to 2|2 to 3|3 to 2|
How to read {aaabbbaa }?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|2 to 2|2 to 3|3 to 2|
How to read { aabbbaaabb}?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 3|3 to 2|2 to 2| 2 to 3|3 to 2|2 to 2|
How to read {aaabaabaab}?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 3|3 to 2|2 to 2|2 to 3|3 to 2|2 to 2|
How to read { aaabbbbbbaaaabb}?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to 2| 2 to 2|2 to 3|3 to 2|2 to 3| 3 to 2 |2 to 2| 2 to 2|
How to read {aaabbbbbaaaaabb }?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|2 to 2|2 to 2| 2 to 2|2 to 2|2 to 3|3 to 2|2 to 3|3 to 2|2 to 2|2 to 2|
How to read { aaabbbaabbaabbbbbbaa}?
0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|2 to 2|2 to 3|3 to 2|2 to 2|2 to 2|2 to 3|3 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to2 |2 to 3|3 to 2|
How to read {abbbbbbbbbbbaaaabaab }?
|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 to2 |2 to 2 |2 to 2|2 to 2|2 to 3|3 to 2|2 to 3|3 to 2| 2 to 2|2 to 3|3 to 2|2 to 2|
How to read { abbbbbbbbbbbbb}?
|0 to 4|4 to 2|2 to 2|2to 2|2 to 2|2 to 2|2 to 2|2to2 |2 to2| 2to 2|2 to2|2 to 2| 2 to2|2to2|2 to3|3to2|2 to 3|3 to2 |2 to 3|3 to 2|2 to 2|2 to 2|2 to 2| 2 to 3|3 to 2|
How to read {aaabbbaaaabbbbaaaabbbbbaa }?
|0 to 4|4 to 5|5 to 2|2 to 2|2 to 2|2 to 2|2 to 3|3 to 2|2 to 3|3 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to 3|3 to 2|2 to 3|3 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to 2|2 to 3|3 to 2|
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.