1.DeIine Automaton?

2.What is the principle oI mathematical Induction?

3.Construct a DFA Ior the regular expression aa*/bb*..
4.Construct a DFA over _(a,b) which produces not more than 3 a`s.
5.Let S-~ aB/bA
A-~aS/bAA/a
B-~bS/aBB/b
Derive the string aaabbabba as leIt most derivation.
6. What is meant by empty production removal in PDA.?
7.State the Pumping lemma Ior CFG.
8. DeIine turing machine
9.What is meant by halting problem.
10.What is post correspondence problem?
PART B (5 x 16 80)
11. (a ) (i) Prove that Ior every integer n~0 the number 42n13n2 is a multiple
oI 13
(ii)construct a DFA that will accept strings ona,b}where the number oI b`s
divisible by 3
(or)
(b) (i) Construct a Iinite automaton that accepts the set oI all strings in a,b,c}*
such that the last symbol in input string appears earlier in the string
12 (a) (i) Construct the regular expression to the transition diagram.


(or)
(b)Construct a NFA Ior regular expression (a/b)*abb and draw its equivalent DFA.
13. (a) Construct a CFG accepting Lambn/nm} and construct a PDA
accepting L by empty store.
(or)
(b)Convert the grammar with productions into CNF A-~Bab/.
14.(a) Design a deteministic turing machine to accept the language
Laibici/i~0}
(or)
14. (b)Determine whether the language given byLAn2/N~1} is a context Iree
or not.
15. (a)Prove that the Iunction Iadd (x,y)xy
is a primitive recursive
(or)
15. (b)Show there exists aTM Ior which the halting problem is unsolvable