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.