Menu

Question Discussion & Solution

MCQ

Q.

Like DFAs, NFAs only recognize regular languages.

A

True

B

False

C

n>

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.

An NFA

A

A Boolean value

B

A state

C

A set of states

D

An edge

Discussion

MCQ

2.

An NFA may be converted to a DFA using __________

A

Induction

B

A construction

C

Contradiction

D

Compilation

Discussion

MCQ

3.

Like DFAs, NFAs only recognize regular languages.

A

True

B

False

C

n>

Discussion

MCQ

4.

A regular language corresponds to __________

A

An alphabet

B

Set of strings over an alphabet

C

A DFA only

D

A DFA or an NFA

Discussion

MCQ

5.

NDFAs where introduced by ____________

A

Michael O Rabin & Dana Scott

B

Dan Brown

C

Sun micro system Labs

D

SAP Labs

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