8. If L is a context-free language, then we can construct a pda A accepting L by empty store, i.e. L = N(A).

 8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).

7. Construct a pda A accepting the set of all strings over {a, b} with equal number of a's and b's.

 7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's.

Construct a pda A accepting L = {WCWT } by final state.

 Construct a pda A accepting L = {WCW^T } by final state. 

5. deterministic pda

 5. deterministic pda

4. move of pushdown automaton.

 4. move of  pushdown automaton. 

3. instantaneous description (ID) of pushdown automaton.

 3. instantaneous description (ID) of pushdown automaton.

III ) Design a TM that accepts {0N1N: n >=1}.

  III )  Design a TM that accepts {0^N1^N: n >=1}.

Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

 Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

2. Definition - pushdown automaton.

 2. Definition -  pushdown automaton.

1. Model of a pushdown automaton.

 1. Model of a pushdown automaton.