Built the finite state automata (FSA) for the language of all those strings starting with a and ending with a but does not contains single a, defined over ∑={a,b}?

Accepted Strings:

Following strings are part of the language and should be accepted by FSA.

Strings = {aa, aba, abba, aaa, aabba, abbaa,…………. }

Rejected Strings:

Following strings are not part of the language and should be rejected by FSA.

Strings = {a, b, ba, bba, abab, baba, babba, abbab,……..….. }

List of 100+ Important Deterministic Finite Automata

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.