Push Down Automata (PDA) MCQ

1. PDA is more powerful than

a) Turing machine

b) Finite automata

c) Both (a) and (b)

d) None of these

2. Which operation can be applied on stack?

a) PUSH

b) POP

c) Both (a) and (b)

d) None of these

3. PDA can be represented with the help of

a) Instantaneous description

b) Transition diagram

c) Transition table

d) All of these

4. Which of the following statement is false?

a) Let L is a language accepted by a PDA P then there exist a CFG G L such that L(G) =N(P)

b) If L is a CFL then there exists a push down automata P accepting CFL L by empty stack i.e. L = N(P)

c) If L is a language accepted by PDA A by final state there exist a PDA B that accepts L by empty stack such that L =L(A) = N(B)

d) All of these

5. A push down automata is different than finite automata by

a) Its memory (stack)

b) Number of states

c) Both (a) and (b)

d) None of these

6. The push down automata indicate the acceptance of input string in terms of

a) Finial state

b) Empty store

c) Both (a) and (b)

d) None of these

7. Which type of symbols contain in the stack of PDA

a) Variable

b) Terminal

c) Both (a) and (b)

d) None of these

8. The instantaneous description is PDA shows

a) Present state

b) Stack symbol

c) String to be processed

d) All of these

9. The symbol Z0 in formal definition of PDA is used for

a) Stack symbol

b) Input symbol

c) Both (a) and (b)

d) None of these

10. A PDA chooses the next move based on

a) Current state

b) Next input symbol

c) Both (a) and (b)

d) None of these