Which among the following is equivalent to the given regular...

MCQ

Which among the following is equivalent to the given regular expression?
01*+1

(01)*+1

0((1)*+1)

(0(1)*)+1

((0*1)1*)*

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the follwing options is incorrect?

A language L is regular if and only if ~L has finite number of equivalent classes.

Let be a regular Language. if ~L has k equivalent classes,then and DFA that recognizes L must have atmost k states

A language is L is NFA-regular if and only if it is DFA-regular

None of the mentioned

Discussion

MCQ

L and ~L are recursive enumerable then L is

Regular

Context free

Context sensitive

Recursive

Discussion

MCQ

Dot operator in regular expression resembles which of the following?

Expressions are juxtaposed

Expressions are multiplied

Cross operation

None of the mentioned

Discussion

MCQ

Choose the correct option:Statement: Unambiguity is the ideal structure of a language

true

partially true

false

cant be said

Discussion

MCQ

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

R = QP*

R = P*Q

R = RP

None of these

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