Q31

MCQ2 marks, −0.67

Let $\text{M}$ be the $5$ -state $\text{NFA}$ with $\epsilon$ -transitions shown in the diagram below.

Which one of the following regular expressions represents the language accepted by $\text{M}$ ?

(A)

$(00)^{*}+1(11)^{*}$

(B)

$0^{*}+\left(1+0(00)^{*}\right)(11)^{*}$

(C)

$(00)^{*}+\left(1+(00)^{*}\right)(11)^{*}$

(D)

$0^{+}+1(11)^{*}+0(11)^{*}$

Loading…