Which of the following pairs of regular expressions are equi...

MCQ

Which of the following pairs of regular expressions are equivalent?

1(01)* and (10)*1

x (xx)* and (xx)*x

x^+ and x^+ x^(*+)

All of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Regular expression (x/y)(x/y) denotes the set

{xy,xy}

{xx,xy,yx,yy}

{x,y}

{x,y,xy}

Discussion

MCQ

Regular expression x/y denotes the set

{x,y}

{xy}

{x}

{y}

Discussion

MCQ

L and ~L are recursive enumerable then L is

Regular

Context free

Context sensitive

Recursive

Discussion

MCQ

Which of the following pairs of regular expressions are equivalent?

1(01)* and (10)*1

x (xx)* and (xx)*x

x⁺ and x⁺ x^(*+)

All of the mentioned

Discussion

MCQ

Let for ?= {0,1} R= (???) *, the language of R would be

{w | w is a string of odd length}

{w | w is a string of length multiple of 3}

{w | w is a string of length 3}

All of the mentioned

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics