Question

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

• A. $(a+b{)}^{\ast }a(a+b)b$
• B. $(a+b{)}^{\ast }a(a+b{)}^{\ast }b(a+b{)}^{\ast }$
• C. $(abb{)}^{\ast }$
• D. $(a+b{)}^{\ast }$

Answer 1

The correct option is A $(a+b{)}^{\ast }a(a+b)b$

Given NFA:

Regular expression equivalent to given NFA is

$(a+b{)}^{\ast }a(a+b)b$.