Aptitude | GATE IT 2006 | Question 5
Which regular expression best describes the language accepted by the non-deterministic automaton below?
(A) (a + b)* a(a + b)b
(C) (a + b)* a(a + b)* b(a + b)*
(D) (a + b)*
Quiz of this Question
Please comment below if you find anything wrong in the above post