Question Discussion & Solution

MCQ

Finite-state acceptors for the nested words can be:

nested word automata

push down automata

ndfa

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

A DPDA is a PDA in which:

No state p has two outgoing transitions

More than one state can have two or more outgoing transitions

Atleast one state has more than one transitions

None of the mentioned

Discussion

MCQ

PDA is more powerful than

Turing machine

Finite automata

Both (a) and (b)

None of these

Discussion

MCQ

A regular Grammar is a _________

CFG

Non CFG

English Grammar

None of the mentioned

Discussion

MCQ

Push down automata accepts which language?

Context sensitive language

Context free language

Recursive language

None of the mentioned

Discussion

MCQ

The transition a Push down automaton makes is additionally dependent upon the:

stack

input tape

terminals

none 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 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