**1.**

PDA is more powerful than

**2.**

PDA can be represented with the help of

**3.**

Which of the following statement is false?

**4.**

A push down automata is different than finite automata by

**5.**

The instantaneous description is PDA shows

**6.**

The symbol Z0 in formal definition of PDA is used for

**7.**

The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as

**8.**

Which of the following statements is true?

**9.**

Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states, The state transition is as following

Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?

**10.**

Which of the following languages are context-free?

```
L1 = {ambnanbm ⎪ m, n ≥ 1}
L2 = {ambnambn ⎪ m, n ≥ 1}
L3 = {ambn ⎪ m = 2n + 1}
```