Question Discussion & Solution

MCQ

The basic limitation of finite automata is that

it can

it sometimes recognize grammar that are not regular

it sometimes fails to recognize regular grammar

None of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In Mealy Machine O/P is associated with ____________

Present state

Next state

Input

None of the mentioned

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

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

There are ________ tuples in finite state machine.

unlimited

Discussion

MCQ

In finite automata, Q stands for?

Finite set of input symbols

Transition function

Finite set of states

One Start state

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 Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

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 Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics