Built the FA for the language of all those strings in which all strings are starting and ending with different letters?
| Accepted Strings |
| You should check some small, some medium and some large size strings that are part of the language and all of them(100% strings) should be accepted by our FA. |
| Small strings:
ab, ba, aab, abb, baa….. and all such strings that are starting and ending with different letters. |
| Medium size strings:
ababab, bababbaba …… and all such strings that are starting and ending with different letters. |
| Large size strings:
ababbababababbabababbabab, bababababbabbbaaaaba……. and all such strings that are starting and ending with different letters. |
| Rejected Strings |
| You should check some small, some medium and some large size strings that are not part of the language and all of them(100% strings) should be rejected by our FA. |
| Small strings:
a, b, aa, bb, aba, bab….. and all such strings that are not starting and ending with different letters. |
| Medium size strings: ababab, bababbaba ……and all such strings that are not starting and ending with different letters. |
| Large size strings:
ababbababababbabababbababa, bababababbabbbaaaabab…….and all such strings that are not starting and ending with different letters. |
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.
