Consider the alphabet Σ = {0, 1}, the null/empty string 𝜆 and the sets of strings X 0 , X 1 , and X 2 generated by the corresponding non - terminals of a regular grammar. X 0 , X 1 , and X 2 are related as follows. X 0 = 1 X 1 X 1 = 0 X 1 + 1 X 2 X 2 = 0 X 1 + {𝜆} Which one of the following choices precisely represents the strings in X 0 ?

Correct Answer is : 1(0 + 10)*1

GATE Computer Science (CS) 2015 Shift 2 Solved Paper

Question : 60 of 65

Marks: +1, -0

Consider the alphabet Σ = {0, 1}, the null/empty string 𝜆 and the sets of strings X₀, X₁, and X₂ generated by the corresponding non - terminals of a regular grammar. X₀, X₁, and X₂ are related as follows.
X₀ = 1 X₁
X₁ = 0 X₁ + 1 X₂
X₂ = 0 X₁ + {𝜆}
Which one of the following choices precisely represents the strings in X₀?

10(0* + (10)*)1
10(0* + (10)*)*1
1(0 + 10)*1
10(0 + 10)*1 + 110(0 + 10)*1

Validate

Go to Question:

Prev Question

Next Question