Question Discussion & Solution

MCQ

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

True

False

May be

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Given: ?= {a, b}
L= {x??*|x is a string combination}
?4 represents which among the following?

{aa, ab, ba, bb}

{aaaa, abab, ?, abaa, aabb}

{aaa, aab, aba, bbb}

All of the mentioned

Discussion

MCQ

Which of the following statement is true for Moore Machine?

Output depends on present state

Output depends on present input

Output depends on present state and present input

Output depends on present state and past input

Discussion

MCQ

The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

01,0011,010101

0011,11001100

?,0011,11001100

Discussion

MCQ

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

aba*b*bba

ab(ab)*bba

ab(a+b)*bba

All of the mentioned

Discussion

MCQ

FSM with output capability can be used to add two given integer in binary representation. This is

True

False

May be true

None of the mentioned

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics