Finite State Automata for the language of all those string starting with a in theory of automata

Built the finite automata (FA) for the language of all those string starting with a defined over ∑={a,b}?

Accepted Strings:

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

Strings = {aaa, aba, abb, aaa, aabba, abbaa,…………. }

Rejected Strings:

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

Strings = {b,  ba, bba, bab,  baba, babba, bbabba,……..….. }

 

FA in theory of automata

  List of All Finite Automata examples: Click Here .