Q12

MCQ1 mark, −0.33

Which one of the following regular expressions is equivalent to the language accepted by the $\text{DFA}$ given below?

(A)

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

(B)

$0^{*}\left(10^{*} 11\right)^{*} 0^{*}$

(C)

$0^{*} 1\left(010^{*} 1\right)^{*} 0^{*}$

(D)

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

Loading…