Question Discussion & Solution

MCQ

Find the wrong statement?

The language accepted by finite automata are the languages denoted by regular expression

Every DFA has a regular expression denoting its language

For a regular expression r, there does not exists NDFA with L

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Can a DFA simulate NDFA?

Yes

Sometimes

Depends on NDFA

Discussion

MCQ

A deterministic finite automation (DFA)D with alphabet ? = {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D?

Discussion

MCQ

What is the relation between NFA-accepted languages and DFA accepted languages?

Discussion

MCQ

What is the complement of the language accepted by the NFA shown below? Assume ? = {a} and ? is the empty string.

{a, ?}

Discussion

MCQ

Which behaviour of a NFA can be stimulated by DFA?

Always

Sometimes

Never

Depends on NFA

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