Menu

Question Discussion & Solution

MCQ

Q.

For every DFA, there is a ?-NFA that accepts the same language

A

True

B

False

C

May be

D

Can't say

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.

If the NFA N has n states, then the corresponding DFA D has 2n states

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

2.

A regular language over an alphabet ? is one that cannot be obtained from the basic languages using the operation

A

Union

B

Concatenation

C

Kleene*

D

All of the mentioned

Discussion

MCQ

3.

A finite automata recognizes ____________

A

Any Language

B

Context Sensitive Language

C

Context Free Language

D

Regular Language

Discussion

MCQ

4.

Transition function maps.

A

? * Q -> ?

B

Q * Q -> ?

C

? * ? -> Q

D

Q * ? -> Q

Discussion

MCQ

5.

Regular expression for all strings starts with ab and ends with bba is.

A

aba*b*bba

B

ab(ab)*bba

C

ab(a+b)*bba

D

All of the mentioned

Discussion

More Compiler Design Topics

Compiler Design Basics

61 MCQs

Non Deterministic Finite Automata

26 MCQs

Lexical Analysis

64 MCQs

Regular Expressions

64 MCQs

Finite Automata

48 MCQs

Syntax Analyser

29 MCQs

Semantic Analyser

11 MCQs

Run Time Environment

10 MCQs

Code Generation

12 MCQs

Code Optimization

22 MCQs

Parsing

110 MCQs

Transformation from NFA to DFA

15 MCQs

Cross Compiler

15 MCQs

Epsilon Moves

15 MCQs