Menu

Question Discussion & Solution

MCQ

Q.

Which of the following represents a language which has no pair of consecutive 1

A

(0+10)*(1+?)

B

(0+10)*(1+?)*

C

(0+101)*(0+?)

D

(1+010)*(1+?)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

All

A

Programmatic description

B

Window

C

Win Object

D

Collection

Discussion

MCQ

2.

Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.

A

N^2

B

2^N

C

2N

D

N!

Discussion

MCQ

3.

a? is equivalent to

A

a

B

a+?

C

a+?

D

wrong expression

Discussion

MCQ

4.

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

A

{xy,xy}

B

{xx,xy,yx,yy}

C

{x,y}

D

{x,y,xy}

Discussion

MCQ

5.

Which of the following is true?

A

Only S1 is correct

B

Only S2 is correct

C

Both S1 and S2 are correct

D

None of S1 and S2 is correct

Discussion

More Theory of Automata Topics

Reqular Expressions

114 MCQs

Finite Automata

44 MCQs

Context Free Grammars

76 MCQs

Push Down Automata

37 MCQs

Regular and context free languages

65 MCQs

Pumping Lemma

14 MCQs

Turning Machine

14 MCQs