Computer Sciences > GATE 2015 SET-2 > Formal Languages
Consider the alphabet Σ = {0, 1}, the null/empty string λ and the sets of strings X0, X1, and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1, and X2 are related as follows.
X0 = 1X1
X1 = 0X1 + 1X2
X2 = 0X1 + {λ}
Which one of the following choices precisely represents the strings in X0?
X0 = 1X1
X1 = 0X1 + 1X2
X2 = 0X1 + {λ}
Which one of the following choices precisely represents the strings in X0?
Correct : b
Similar Questions
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
Let L be a language and L' be its complement. Which one of the following is NOT a viable possibility?
Total Unique Visitors
Loading......