Which type of string is accepted by the following finite aut...

MCQ

Which type of string is accepted by the following finite automata?

All string

Null string

No string

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

The string WWR is not recognized by any FSM because _____________

An FSM cannot remember arbitrarily large amount of information

An FSM cannot fix the midpoint

An FSM cannot match W with WR

An FSM cannot remember first and last inputs

Discussion

MCQ

Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?

Statement 1 is false but Statement 2 and 3 are correct

Statement 1 and 2 are correct while 3 is wrong

None of the mentioned statements are correct

All of the mentioned

Discussion

MCQ

For the following change of state in FA, which of the following codes is an incorrect option?

? (m, 1) = n

? (0, n) = m

? (m,0) = ?

s: accept = false; cin >> char;
if char = "0" goto n;

Discussion

MCQ

The production Grammar is {S->aSbb,S->abb} is __________ grammar.

Type-3

Type-2

Type-1

Type-0

Discussion

MCQ

Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be itsstates; Statement 3: The edges or arcs can be used for transitionsHint: Nodes and Edges are for trees and forests too.Which of the following make the correct combination?

Statement 1 is false but Statement 2 and 3 are correct

Statement 1 and 2 are correct while 3 is wrong

None of the mentioned statements are correct

All 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