Regular expression are...

MCQ

Regular expression are

Type 0 language

Type 1 language

Type 2 language

Type 3 language

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 following is correct?
Statement 1: ? represents a single string in the set.
Statement 2: ? represents the language that consist of no string.

Statement 1 and 2 both are correct

Statement 1 is false but 2 is correct

Statement 1 and 2 both are false

There is no difference between both the statements, ? and ? are different notation for same reason

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

MCQ

Which among the following looks similar to the given expression?((0+1). (0+1)) *

{x? {0,1} *|x is all binary number with even length}

{x? {0,1} |x is all binary number with even length}

{x? {0,1} *|x is all binary number with odd length}

{x? {0,1} |x is all binary number with odd length}

Discussion

MCQ

The production Grammar is {S->aSbb,S->abb} is

Type-3 grammar

Type-2 grammar

Type-1 grammar

Type-0 grammar

Discussion

MCQ

Which of the following is true?

(01)*0 = 0(10)*

(0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*

(0+1)*01(0+1)*+1*0* = (0+1)*

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