Push Down Automata Quiz

A push down automaton employs ________ data structure.

• Queue

• Linked List

• Hash Table

• Stack

State true or false: Statement: The operations of PDA never work on elements, other than the top.

• true

• false

Which of the following allows stacked values to be sub-stacks rather than just finite symbols?

• Push Down Automaton

• Turing Machine

• Nested Stack Automaton

• None of the mentioned

A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.

• 5

• 8

• 4

• 10

Push down automata accepts _________ languages.

• Type 3

• Type 2

• Type 1

• Type 0

The class of languages not accepted by non deterministic, nonerasing stack automata is _______

• NSPACE(n2)

• NL

• CSL

• All of the mentioned

A push down automaton with only symbol allowed on the stack along with fixed symbol.

• Embedded PDA

• Nested Stack automata

• DPDA

• Counter Automaton

Which of the operations are eligible in PDA?

• Push

• Delete

• Insert

• Add

A string is accepted by a PDA when

• Stack is not empty

• Acceptance state

• All of the mentioned

• None of the mentioned

The following move of a PDA is on the basis of:

• Present state

• Input Symbol

• Present state and Input Symbol

• None of the mentioned