Menu

Question Discussion & Solution

MCQ

Q.

Which is true for in accessible state?

A

It cannot be reached anytime

B

There is no necessity of the state

C

If control enters no way to come out from the state

D

If control enters FA deads

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.

Number of states require to simulate a computer with memory capable of storing

A

3 * 2⁸

B

2^(3*8)

C

2⁽³⁺⁸⁾

D

None of the mentioned

Discussion

MCQ

2.

Number of states require to accept string ends with 10.

B

1

C

2

D

3

Discussion

MCQ

3.

The minimum number of states required to recognize an octal number divisible by 3 are/is

A

1

B

3

C

5

D

7

Discussion

MCQ

4.

Language of finite automata is

A

Type 0

B

Type 1

C

Type 2

D

Type 3

Discussion

MCQ

5.

?*(q,ya) is equivalent to .

A

?((q,y),a)

B

?(?*(q,y),a)

C

?(q,ya)

D

independent from ? notation

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