Consider alphabet ? = {0, 1}, the null/empty string ? and the sets of – McqOptions

MCQOPTIONS

1.	Consider alphabet ? = {0, 1}, the null/empty string ? and the sets of strings X0, X1 and X0.How are X1 and X2 are related ?X0 = 1 X1X1 = 0 X1 + 1 X2X2 = 0 X1 + {?}Which one of the following represents the strings in X0?
A.	10 (0* + (10)*)1
B.	10 (0* + (10))1
C.	10 (0* + (10))1
D.	10 (0 + 10)1 + 110 (0 + 10)1
Answer» D. 10 (0 + 10)1 + 110 (0 + 10)1

Discussion

No Comment Found

Related MCQs

The set of all strings over ? = {a,b} in which all strings having bbbb as substring is
Which of the following languages is/are regular?L1: {wxwR ? w, x ? {a, b}* and ?w?, ?x? >0} wR is the reverse of string wL2: {anbm ?m ? n and m, n=0L3: {apbqcr ? p, q, r = 0}
Which of the following pairs of regular expression are equivalent?
Consider alphabet ? = {0, 1}, the null/empty string ? and the sets of strings X0, X1 and X0.How are X1 and X2 are related ?X0 = 1 X1X1 = 0 X1 + 1 X2X2 = 0 X1 + {?}Which one of the following represents the strings in X0?
Which of the following identity is true?
How many minimum states are required to find whether a string has odd number of 0's or not?
The set of all strings over ? = {a,b} in which strings consisting a's and b's and ending with in bb is
Assume the statements S1 and S2 given as :S1 : Given a context free grammar, there exists an algorithm for determining whether L(G) is infinite.S2 : There exists an algorithm to determine whether two context free grammars generate the same language.Which of the following is true ?
The string (