Theory of Computation BCS503
Question Bank
Module 3
1.Define Left Most and right most derivation and parse tree, consider the
grammar S->AbB,A->aA|€,B->aB|bB|€,Obtain LMD and RMD Parse
tree for the string “aaabab”
2. Define Context free Grammar and construct the CFG for the
following Languages.
i) Set of Palindromes
ii) L={0m1m2n | m>=1,n>=0}
iii) L={wwR w€ {a.b}*}
iv) L={anbn |n>=0}
v) L= {an b2n ,n>=0 }
vi) Integer
vii) Valid Identifier
3.Obtain the LMD and RMD and parse tree for the given grammar
S aB|bA , A aS |bAA |a, BbS|aBB|b for the string w=
aaabbabbba.
4. Explain the PDA construct the PDA for the given Language
L= {wwR : w belons to (a+b)*} ,Obtain the instantaneous
descriptions for the string “aabbaa”
5. Construct the PDA to accept the Language L={anbn |n >=1}
6.Construct the PDA to accept the Language L={WCWR |w belongs
to {a,b}*}
7.Define ambiguous grammar and show that given G is
ambiguous
S-> iCtSeS | iCtS |a, C-> b for the String W- “ibtaea”
Module 4
8. Illustrate the CNF form for the given grammar
S S+T |T/R , TT*a |b , RR* a
9. Illustrate the CNF form for the given grammar
S Aba , Aaab ,BAc
10. State and Prove pumping lemma for context free Languages
And prove that L={anbncn | n>=0 is not context free}
11. Explain the properties of CFL
12.Simplify the grammar by eliminating epsilon,Unit and useless
Symbols
S->AB|AC , A-> aAb |€ , B->bA ,C->bCa ,D->AB
Module 5
13. Explain Turing Machine ,Construct the turing machine to accept
the language i) L ={anbn }n >=1 } and accept the string aabb
ii) L={anbncn |n >=1} and accept the string aabbcc
14. Explain the Programming techniques and Extension to turing
machines.
15. Explain the undecidability problem and Languages that is not
recursively enumberable.
