Q4

MCQ1 mark, −0.33

Consider the Deterministic Finite-state Automaton ( $\text{DFA}$ ) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$ , and has the set of states $\{s, p, q, r\}$ , with $s$ being the start state and $p$ being the only final state.

Which one of the following regular expressions correctly describes the language accepted by $\mathcal{A}?$

(A)

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

(B)

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

(C)

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

(D)

$1\left(110^{*}\right)^{*}$

Loading…