Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

(A) b*ab*ab*ab
(B) (a+b)*
(C) b*a(a+b)*
(D) b*ab*ab
Correct answer : Option (C) - b*a(a+b)*

Share

Discusssion

Login to discuss.