Q2.9

MCQMarks unknown

Define a context free languages $L \in \{0, 1\}^*$ , $\text{init} (L) = \{u \mid uv \in L$ for some $v$ in $\{0, 1\}^*\}$ ( in other words, $\text{init}(L)$ is the set of prefixes of $L$ ) Let $L = \{w \mid w \text{ is nonempty and has an equal number of$ 0 $’s and$ 1 $’s}\}$ Then $\text{init} (L)$ is:

(A)

the set of all binary strings with unequal number of $0$ ’s and $1$ ’s

(B)

the set of all binary strings including null string

(C)

the set of all binary strings with exactly one more $0$ than the number of $1$ ’s or one more $1$ than the number of $0$ ’s

(D)

None of the above

Loading…