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

Language of finite automata is

Type 0

Type 1

Type 2

Type 3

Discussion

MCQ

Number of final state require to accept ? in minimal finite automata.

None of the mentioned

Discussion

MCQ

In finite automata, Q stands for?

Finite set of input symbols

Transition function

Finite set of states

One Start state

Discussion

MCQ

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

01,0011,010101

0011,11001100

?,0011,11001100

Discussion

MCQ

What is the transitional function of an NFA?

Q X ??Q

Q X ??2Q

Q X ??2n

Q X ??Qn

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