Question Discussion & Solution

MCQ

Regular Expression R and the language it describes can be represented as:

R, R(L)

L(R), R(L)

R, L(R)

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

All

Programmatic description

Window

Win Object

Collection

Discussion

MCQ

Which of the following pair of regular expression are not equivalent?

1(01)* and (10)*1

x(xx)* and (xx)*x

(ab)* and a*b*

x+ and x*x+

Discussion

MCQ

How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Discussion

MCQ

Precedence of regular expression in decreasing order is

* , . , +

. , * , +

. , + , *

+ , a , *

Discussion

MCQ

For an automata, which of the following are equivalant variants ?DFA,NFA and NFA with epsilon transitions

DFA and NFA

NFA and epsilon NFA

DFA and epsilon NFA

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