Built the finite automata FA for the language of all those strings starting and ending with b?
Accepted Strings
Following string must be accepted by the FA;
b, bb,bab,baab,bbab,…….
Rejected Strings
Following string msut be rejected by the FA;
a, ab,ba,baa,baba,…….
