The minimum number of 1’s to be used in a regular expression of the – McqOptions

MCQOPTIONS

1.	The minimum number of 1’s to be used in a regular expression of the given language:R(x): The language of all strings containing exactly 2 zeroes.
A.	2
B.	3
C.	0
D.	1
Answer» C. 0

Discussion

No Comment Found

Related MCQs

A->aAa|bAb|a|b|eWhich among the following is the correct option for the given production?
Statement: Left most derivations are lengthy as compared to Right most derivations.Choose the correct option:
Statement: A digit, when used in the CFG notation, will always be used as a terminal.State true or false?
Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.Which of the following is a correct option for the given statement?
The given regular language corresponds to which of the given regular languagee+1+(1+0)*0+(0+1)*11
The minimum number of 1’s to be used in a regular expression of the given language:R(x): The language of all strings containing exactly 2 zeroes.
Which of the following regular expression is equivalent to R(1,0)?R(1,0)={111*}*
The minimum length of a string {0,1}* not in the language corresponding to the given regular expression:(0*+1*)(0*+1*)(0*+1*)
STATEMENT:_LEFT_MOST_DERIVATIONS_ARE_LENGTHY_AS_COMPARED_TO_RIGHT_MOST_DERIVATIONS.?$
A->aAa|bAb|a|b|e$