Finite State Automata for the language of all those string containing aa as a substring in theory of automata

Built the finite automata for the language of all those string containing aa as a substring at least one times, defined over ∑={a,b}?

Accepted Strings:

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

Strings = {aa, abaa, aaba, abaa, aabba, abbaa,…………. }

 

Rejected Strings:

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

Strings = {baaba, abba,  bba, babba, abbab,…………. }

finite state automata for the languages of all those strings containing aa as a substring

  List of All Finite Automata examples: Click Here .