The regular expression for the language recognized by the finite state…

PYQ GATE 1994

The regular expression for the language recognized by the finite state automaton of figure is __________

Automaton with initial accepting state A looping on 0, transition A to accepting B on 1, B looping on 1, transition B to nonaccepting trap C on 0, and C looping on both 0 and 1.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…