Grammer and PDA

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

• stack

• input tape

• terminals

• none of the mentioned

A PDA machine configuration (p, w, y) can be correctly represented as:

• (current state, unprocessed input, stack content)

• (unprocessed input, stack content, current state)

• (current state, stack content, unprocessed input)

• none of the mentioned

|-* is the __________ closure of |-

• symmetric and reflexive

• transitive and reflexive

• symmetric and transitive

• none of the mentioned

With reference of a DPDA, which among the following do we perform from the start state with an empty stack?

• process the whole string

• end in final state

• end with an empty stack

• all of the mentioned

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

Pushdown automata accepts

• Regular language

• Context-free language

• Context-sensitive language

• Both Regular and context-free language

What is addition in pushdown automata as compare to finite state automata?

• Stack memory

• Input Tape

• Read Head

• None of them

If the PDA does not stop on an accepting state and the stack is not empty, the string is:

• rejected

• goes into loop forever

• both (a) and (b)

• none of the mentioned

A language accepted by Deterministic Push down automata is closed under which of the following?

• Complement

• Union

• Both (a) and (b)

• None of the mentioned

Finite-state acceptors for the nested words can be:

• nested word automata

• push down automata

• ndfa

• none of the mentioned