BHARATI VIDYAPEETH COLLEGE OF ENGINEERING FOR WOMEN, PUNE

COMPUTER ENGINEERING FOR WOMEN, PUNE

UNIT TEST II

THEORY OF COMPUTATION

1. Construct PDA for accepting {an b2n | n>=1}.

2. Define PDA and compare Deterministic PDA with non-deterministic PDA
3. Design PDA for detection of even palindrome over {a, b}.
4. Convert the following grammar to PDA
S  0S1 | A A 1A0 | S | ^

5. Design PDA for accepting {an bman | m, n >= 1}

6. Justify with suitable example the following statement:
Two stack PDA is more powerful than one stack PDA
7. Design a TM to find 2’s complement of a binary number.
8. Design TM which accepts all strings of the form anbn for n>=1 and rejects all other
strings.
9. Differentiate between PDA and Turing Machine.
10. Design right shift TM over alphabet {0,1}.
11. Write a short note on Universal TM.
12. Design a TM to copy a string over {a, b}*.
13. Explain following terms in detail:
i) Two way infinite TM ii) Multi-tape TM
14. Design TM to compute multiplication of two unary numbers.
15. Construct a PDA that accepts L ={an bn|n>=1} through empty stack.
16. Convert the PDA with following moves into a CFG.

δ(q0, a, Z0) = {(q0, a, Z0)}

δ(q0, a, a) = {(q0, aa)}
δ(q0, b, a) = {(q1, ε )}
δ (q1, b, a) = {(q1, ε )}
δ (q0, ε , Z0) = {(q1, ε )}