TAFL Unit 4 Quiz: Push Down Automata

A push down automata is different than finite automata by:

• Its memory

• Number of states

• Both (a) and (b)

• None of these

Which automata takes stack as storage?

• Finite automata

• Push down automata

• Turing machine

• Regular expression

PDA is more powerful than

• Turing machine

• Multi tape Turing machine

• Finite automata

• All of these

Which of the following are the actions that operates on stack top?

• Pushing

• Updating

• Popping

• All of the mentioned

PDA consist of:

• State

• Unconsumed input

• Stack content

• All of the mentioned

In definition of PDA what represents?

• Initial stack symbol

• Stack alphabet

• Finite set of states

• Transition function

PDA is useful in:

• Lexical analysis

• Semantic analysis

• syntactic analysis

• All of these

A pushdown automata is _______if there is at most one transition to each configuration

• Nondeterministic

• Deterministic

• Non finite

• Finite

PDA always works on top element of stack

• True

• False

• May be

• Can't say

A push down automata can represented using:

• Transition graph

• Transition table

• Instantaneous Description (ID) (q, a, X)

• All of the mentioned