The regular expression denote a language comprising all possible strin – McqOptions

MCQOPTIONS

1.	The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1)
A.	1 + 0(1+0)*
B.	(0+1)(1+0)*
C.	(1+0)
D.	(00+0111+10)*
Answer» E.

Discussion

No Comment Found

Related MCQs

The degree of static indeterminacy of a rigid-jointed space frame is (Where m, r and j have their usual meanings)
A pin-jointed plane frame is unstable if (Where m is number of members, r is reaction components and j is number of joints)
A rigid-jointed plane frame is stable and statically determinate if (Where m is number of members, r is reaction components and j is number of joints)
In the slope deflection equations, the deformations are considered to be caused by
Muller Breslau's principle for obtaining influence lines is applicable to
The regular expressions denote zero or more instances of an x or y i?
The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1)
Regular expression (x/y)(x/y) denotes the set
The production Grammar is {S->aSbb, S->abb} is
Give a production grammar for the language L = {x/x ‚Äö√Ñ√∂‚àö‚Ä†‚àö‚Ä† (a,b)*, the number of a‚Äö√Ñ√∂‚àö√ë‚àö¬•s in x is multiple of 3}.$