Q40

MSQ2 marks

Consider the $5$ -state $\text{DFA}$ . $M$ accepting the language $L(M) \subset(0+1)^{*}$ shown below. For any string $w \in(0+1)^*$ let $n_0(w)$ be the number of $0^{\prime} s$ in $w$ and $n_1(w)$ be the number of 1 's in $w$ .

Which of the following statements is/are FALSE?

(A)

States $2$ and $4$ are distinguishable in $M$

(B)

States $3$ and $4$ are distinguishable in $M$

(C)

States $2$ and $5$ are distinguishable in $M$

(D)

Any string $w$ with $n_0(w)=n_1(w)$ is in $L(M)$

Loading…