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

By: Prof. Fazal Rehman Shamil
Last modified on May 15th, 2020

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

finite state automata

Video Lecture

List of 100+ Important Deterministic Finite Automata

Prof. Fazal Rehman Shamil
Latest posts by Prof. Fazal Rehman Shamil (see all)