Sl.
no Questions-Module-4
01 State and prove Pumping Lemma theorem for Context-Free Languages.
02 Explain in detail the closure properties of Context-Free Languages.
03 Define Chomsky Normal Form (CNF). Convert the following Context Free
Grammar to CNF.
S→aACa
A→B/a
B→C/c
C→cC/λ
04 Construct a Push Down Automata that accepts the language generated by the
grammar with production S→aSbb/aab. Verify the productions for aaabbb.
05 Show that L={anbncn | n>=1}is not Context free language.
06 Show that CFL is not closed under Intersection, Complement and set-difference.
07 Define decidable language prove that DFA is decidable language (ADFA is decidable)
08 State and Explain Church-Turing thesis,
restricted Turing machine,
Non-Deterministic Turing Machine
09 Explain the following with example
1) Decidability
2) Decidable languages
3) Undecidable languages
4) Problems that computers cannot solve
10 Prove that ATM is undecidable
11 Construct a TM that accepts the language 0 1* + 1 0*. Which programming
technique of TM construction can be used for this and explain the other available
techniques of TM construction.
12 ST L={an! /n>=0} is not context free
13
14
15
16
17
18
19
20
21
22
23 Eliminate useless symbols from the grammar G={V,T,P,S}with production rules
P={S→aS/A/C, A→a, B→aa, C→aCb}
SI NO Questions-Module-5
01 Write a neat diagram, explain variant of Turing machine 10M
02 Define Turing Machine with its tuples. 3M
03 Design a Turing Machine to accept strings formed on {0,1} and ending with 000. Write
transition diagram and ID for w =101000. 8M
04 Define Turing Machine (TM). Design a TM for language L = {0n,1n|n>=1}. Show that the
string 0011 is accepted by ID.
10M
05 Explain any two techniques for TM construction. 8M
07 Design a TM for the language L = {1n,2n,3n | n>=1} show that the string 11 2233 is
accepted by ID. 8M
08 Define TM and design a turing machine for L ={w|w E (0+1)* containing the substring
001} Write transition diagram and show the moves made by the Turing machine for input
string 10010 10M
10 Define and explain DTM and NDTM 5M
11 Write a neat diagram and explain the working of Multitape Turing Machine 5M
12 Define Turing machine. Explain with neat diagram the working of a Turing machine
model
14 Design turing machine to accept the language L = {anbncn | n>=1}.Draw the transition
diagram and show the moves made by turing machine for the string aabbcc.
15 Explain various techniques used for construction of turing machine
16 Explain halting problem in Turing machine prove that HALTTM={(M,W)|the Turing machine M
halts on input w} is undecidable
