#### Question

a.

1 + 0(1+0)*

b.

(0+1) (1+0)*

c.

(1+0)

d.

(00+0111+10)*

Posted under Formal Languages and Automata Theory

#### Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

###### Q. The regular expression denote a language comprising all possible strings of even length over the alphabet (0, 1)

## Similar Questions

###### Discover Related MCQs

Q. The RE gives none or many instances of an x or y is

View solution

Q. The RE in which any number of 0′s is followed by any number of 1′s followed by any number of 2′s is

View solution

Q. The regular expression have all strings of 0′s and 1′s with no two consecutive 0′s is :

View solution

Q. The regular expression with all strings of 0′s and 1′s with at least two consecutive 0′s is:

View solution

Q. Which of the following is NOT the set of regular expression R = (ab + abb)* bbab

View solution

Q. String generated by

S->aS/bA,

A->d/ccA

View solution

Q. Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.

View solution

Q. If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is ———.

View solution

Q. Regular expression a/b denotes the set

View solution

Q. In regular expressions, the operator ‘*’ stands for

View solution

Q. Find the pair of regular expressions that are equivalent

View solution

Q. 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 X1

X1 = 0 X1 + 1 X2

X2 = 0 X1 + {λ}

Which one of the following represents the strings in X0?

View solution

Q. Which of the following pairs of regular expression are equivalent?

View solution

Q. Which of the following identity is true?

View solution

Q. The set of all strings over ∑ = {a,b} in which all strings having bbbb as substring is

View solution

Q. The set of all strings over ∑ ={a,b} in which a single a is followed by any number of b’s a single b followed by any number of a’s is

View solution

Q. Regular expressions are used to represent which language

View solution

Q. The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is

View solution

Q. If P, Q, R are three regular expressions and if P does not contain a then the equation R = R + RP has a unique solution given by

View solution

Q. Which of the following regular expression denotes zero or more instances of an a or b?

View solution

# Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!