GATE | IT | 2006 | TOC | Finite Automata | Question 5

Last Updated :
Discuss
Comments

Which regular expression best describes the language accepted by the non-deterministic automaton below?

download (7)

 

(a + b)* a(a + b)b

(abb)*

(a + b)* a(a + b)* b(a + b)*

(a + b)*

This question is part of this quiz :

Regular languages and finite automata,GATE IT 2006
Tags:
Theory of Computation
GATE
Share your thoughts in the comments