Theory Of Computation MCQ

1:

Define for the context free language
L< {0;1} init (L) =  { u | u v   ε  L for some v in {0, 1}}

If L { w | w is nonempty and has an equal number of 0's and 1's}, then init (L) is set of all binary strings

A.

with unequal numbers of 0's and 1's.

B.

including the null string.

C.

Both (a) and (b)

D.

None of these

 

Answer : B

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.