ATC QUESTION BANK ON M3,M4

1. Prove the closure properties of Context free languages.

2. problem on removing useless productions.
3. State and prove pumping lemma for context free language.
4. problem on Converting CFG to CNF
5. Construct TM to accept the language L = {0n1n | n>0}.Show ID for the string “0011"
6. Design Turing machine for the language L= { WWR | W Ԑ {a,b}*}
7. Design Turing machine to accept the language L = {1n2n3n | n ≥ 0}.
8. Design a Turing Machine that accepts the strings of a’s and b’s that end with ‘ab’. Show
the moves made by the string on the input ‘bbaaaab’
9. Construct a Turing machine that accepts language L = {w | w € (a + b)* and every w
contains the substring ‘bab’}. Show instantaneous description on the input string
‘aababb’.
10. Design Turing machine for the language L= {anbn | n>0 }. Give ID for the string
“aaabbb”.
11. Construct TM to accept the language L = {anbncn | n>0}.Show ID for the string “aabbcc"
12. Design TM that can compute concatenation function on ∑ = {1}, if the input format is
W1BW2, then the output will be W1W2
13. prob on Constructing the equivalent CNF from CFG.
14. State and prove the properties of Recursively enumerable languages
15. Simplifying CFG by eliminating epsilon and unit rules.
16. Define CNF. Construct CNF from the following grammar problem
17. State and prove the properties of Recursive languages.
18. Construction of PDA
19. explain:Recursively Enumerable language ii) Decidable language.
20. Show that L = {0n1n2n | n>0} is not context free.
21. Show that L = {W|W € {a,b,c}* is not context free. where na(w)=nb(w)
22. Show that L = {WW | W € {a,b}*} is not context free.
23. Show that L = {an!| n>0} is not context free.
24. Prove that multi-tape TM is equivalent to single tape TM
25. Describe the different ways of representing Turing Machine with suitable example.
26. Explain the techniques for TM construction
27. Explain the working of TM model with block diagram.
28. Explain Quantum computation, with suitable example.
29. Design a Turing Machine to perform multiplication of two integers ‘m’ and ‘n’.
30. Prove that Context free languages are not closed under complementation, intersection and
difference.
31. Prove that Non deterministic TM is equivalent to deterministicTM.
32. Explain the working of Turing machine model.
33. Explain briefly the following:
Class P and NP ii) Post correspondence problem.
34. Explain the variants of Turing machine.
35. prove the following theorem:
ATM is undecidable, ADFA is decidable, ACFG is decidable, Acsg is decidable
36. Prove that HALTTM = {(M,W) | Turing machine M halts on input ‘w’ is undecidable}.
37. Explain with suitable example the different representations of TM
38. Explain in detail the halting problem of Turing machine.
39. Briefly explain the following:
i).Quantum computer ii) Linear bounded automata. iii) explain churching turing thesis.
40. Explain Quantum computation, with suitable example.