Menu

Question Discussion & Solution

MCQ

Q.

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

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

Discussion

MCQ

3.

For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.

A

True

B

False

C

n>

Discussion

MCQ

4.

The regular languages are not closed under ___________

A

Concatenation

B

Union

C

Kleene star

D

Complement

Discussion

MCQ

5.

Which is the application of NFA?

A

A regular language is produced by union of two regular languages

B

The concatenation of two regular languages is regular

C

The Kleene closure of a regular language is regular

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