1.What are formal languages? Explain diagonal argument and rusell’s
paragraph?
2.Explain chomsky hierarchy of language?
3.(a) what do you understand by deterministic finite automata and non
deterministic finite automata? ) Consider the NFA shown in figure,
construct equivalent DFA symbol e stand for nul
4 (a) State pumping lemma for regular sets and explain the application of
pumping lemma.8
(b) Minimize the finite automata given below and explain how minimum
automata is constructed(q3 is final state in this diagram)
5(a) constructs the regular expression accepted by finite automaton
b) Convert the grammar S->AB,A->BS/b ,B->SA/a INTO GNF?
6(a) Construct the leftmost and rightmost parse tree for the
foll.GrammerWhich accepted the string aaabbabbba?
b) Generate the grammar for
7 (a) what is push down automata? Explain its application with example? 8
(b) Construct PDA accepting L={w E (a, b)*}, the no of a’s equal to no of
b’s.8
8(a) prove that the grammar is ambiguous and remove its ambiguity
 S->SS/a/b
(b) What is CFG? Convert CFG INTO CNF?
9(a) Construct a Turing machine that can accept all set of all even palindrome
over {0,1} 8
(b) Define Turing machine? Explain halting problem of Turing Machine? 8
10(a) Construct a Turing machine that can accept the following language
(b) What is undecidability? Explain PCP & modified PCP in detail
Thank
You