Finite automata FA for the language of all those strings starting and ending with b in theory of automata

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,…….

  List of All Finite Automata examples: Click Here .

Prof. Fazal Rehman Shamil Researcher, Publisher of International Journal Of Software Technology & Science ISSN: 2616-5325 Instructor, SEO Expert, Web Programmer and poet. Feel free to contact.