Q. 46 Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X, X1 and X2generated by the corresponding non-terminals of a regular grammar. X, X1 and X2 are related as follows:
X = 1 X1
X1 = 0 X1 + 1 X2
X2 = 0 X1 + {λ}
Which one of the following choices precisely represents the strings in X?
(A) 10 (0* + (10)*)1
(B) 10 (0* + (10)*)*1
(C) 1(0* + 10)*1
(D) 10 (0 + 10)*1 + 110 (0 + 10)*1
Answer: (C)
Explanation:
