Question Discussion & Solution

MCQ

String X is accepted by finite automata if .

?*(q,x) E A

?(q,x) E A

?*(Q0,x) E A

?(Q0,x) E A

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Transition function maps.

? * Q -> ?

Q * Q -> ?

? * ? -> Q

Q * ? -> Q

Discussion

MCQ

The number of elements in the set for the Language L={x?(?r) *|length if x is at most 2} and ?={0,1}is_________

Discussion

MCQ

Which of the following is a not a part of 5-tuple finite automata?

Input alphabet

Transition function

Initial State

Output Alphabet

Discussion

MCQ

Finite automata requires minimum _______ number of stacks.

None of the mentioned

Discussion

MCQ

Ndfa and dfa accept same languages

True

False

May be

Can't say

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