1) a) Construct a NFA that accepts the set of strings in (0+1)* such that some two 0s are seprated by string

whose length is 4i for some i>0 b) For each of following regular expression draw an FA recognizing corresponding languages-: 1) (1+10+110)*0 2) 1(01 +10)*+0(11+10)* 3) (010 + 00)* (10) 4)1(1+10)*+10(0+01)* 2) Explain Moore and Mealy Machine with suitable example. How do we construct equivalent Mealy machine for given Moore machine? Give suitable example.

3) a) Explain property Pumping Lemma of regular set. Where do we apply property? Give suitable example. b) Prove that for any two regular expression r and s over , (r*.s*)*=(r+s)* 4) a) What is Normal form? Explain CNF and GNF with suitable example. b) Find the context Free grammers generating each of these languages: L1 ={ai bi ck |i=j+k}

5) Construct Pushdown Automata for each of following languages1) the set of Palindromes over alphabet{a,b} 2) the set of all strings over alphabet {a,b} with exactly equal numbers of as and bs

6)

Draw a transition table for turning machine accepting the following languages: (1) The language of all non palindromes over {a,b} (2) The language of balanced strings of parentheses. Differentiate all Chomskey hierarchies of grammer with suitable example.

7)

8)Write short note on-: a) Linear bound automata b) Content Sensitive languages c)Myhill Merode theorem. !