The regular expression 0*(10)* denotes the same set as

Related MCQs

• A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
• Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
• Regular expression (x/y)(x/y) denotes the set
• Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
• Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
• Languages are proved to be regular or non regular using pumping lemma.
• Automaton accepting the regular expression of any number of a ' s is:
• Which of the following is not a regular expression?
• How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
• Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?