Question

Consider the regular expression:

$R=(a+b{)}^{\ast }(aa+bb\left)\right(a+b{)}^{\ast }$

Which of the following non-deterministic finite automata recognizes the language defined by the regular expression R ? Edges labeled $\lambda$ denote transition on the empty string.

• A.
• B.
• C.
• D.

Answer 1

The correct option is D

The language of the given regular expression R is 'containing the substring aa or bb' Option (a) is the correct machine for this language.