Which regular expression best describes the language accepted by the…
GATE · 2006 · IT
Which regular expression best describes the language accepted by the non-deterministic automaton below?
- A.
(a + b)* a(a + b)b
- B.
(abb)*
- C.
(a + b)* a(a + b)* b(a + b)*
- D.
(a + b)*
Attempted by 261 students.
Sign up free to check your answer
Sign up freeLoading lesson…