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 = {a, aa, 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,……..….. }
