geeksforgeeks

Question

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)*


Answer: (A) 

DOUBT- I beleive the option A is wrong as dfa can accept string aaab but expression in A can not.

pls clarify? the given answer is wrong or not? if yes, then wha is the correct answer?

Comments

regular expression also accepting aaab.Please check carefully.

Answer 1

Expression A can accept aaab :

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

a           ---------- a

(a+b)    ----------  a

b          -----------  b

---

(a + b)* a(a + b)b can accept " aaab"

Answer 2

Expression is also accepting aaab and option A is correct.