[EURCS 505/EURIT 505] B.Tech.

DEGREE EXAMINATION CSE/IT V SEMESTER FORMAL LANGUAGES & AUTOMATA THEORY

(Effective from the admitted batch 200708)

Time: 3 Hours Max.Marks: 60 ----------------------------------------------------------------------------------Instructions: Each Unit carries 12 marks. Answer all units choosing one question from each unit. All parts of the unit must be answered in one place only. Figures in the right hand margin indicate marks allotted.

----------------------------------------------------------------------------------UNIT-I 1. a) Compare Deterministic and Non-Deterministic Finite Automata. 6 b) Construct deterministic finite Automata to recognize the following. i) Strings of binary ending with the pattern 101 ii) Strings of binary with even length. 6
OR

2. a) Explain the procedure for converting a given DFA to regular Expression. b) Convert the following regular expression to NFA with E-moves. (00+10+01)*. UNIT-II 3. a) State and explain the pumping Lemma for regular sets b) Check whether the following are regular sets i) L= a n b n | n 0 ii) L=

x | x (0 1)* and has equal no of zeros and ones

OR

4. a) Explain the theorem for checking emptiness, finiteness and infiniteness of regular Languages. b) What are indistinguishable states in a finite Automata. Explain the algorithm for minimization of finite Automata. UNIT-III 5. a) Check if the following context free grammar is Ambiguous. E E+E E E*E E id b) Explain the steps involved in eliminating useless symbols in a given context free Grammar
OR

6 6

6 6

6. a) State and explain the closure properties of Context Free Languages. b) Convert the following CFG to Greibach Normal form. S AA A AAA Aa A bA A Ab UNIT-IV 7. a) Give the formal Definition of a Push Down Automata. b) Construct Push Down Automata to recognize the language of equal number of as and bs.
OR

6 6

8. a) Explain the construction steps involved in converting a given Push Down Automata to Context Free Language.

b) Check whether the following Language is LR(K) grammar S (A) Sa A SA Ae UNIT-V 9. What is a Turning Machine. Construct a Turing machine to compute proper subtraction of two positive integers. Proper Subtraction of two integers a and b is a-b if a > b and 0 otherwise
OR

12

10. What are undecidable problems. Check whether the following instance of Posts Correspondence problem (PCP) has a solution or not. i 1 2 3 4

12

xi
b a ca abc

wi
ca ab a c
[3,7/VS/109]