Code: RA 9A05407 B.

Tech III Year I Semester (R09) Supplementary Examinations, May 2013 FORMAL LANGUAGES AND AUTOMATA THEORY
(Computer Science and Engineering)

RA

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1

Max Marks: 70

Suppose M = (Q, , Q0, A, ) is an NFA- recognizing a language L. Describe how to construct an NFA - M2 with exactly one accepting state and no transitions from the state so that M2 also recognizes L. Explain the procedure to convent NFA to ordinary NFA, with a suitable example. Explain and prove Ardens Theorem. Discuss about the equivalence of regular expression and finite automata. Construct CFG without production form Sa|Ab|aBa, Ab|, Bb|A. Explain the relationship between derivation and derivation tree with an example. Using pumping lemma, prove that L = {xx / x {a, b}*} is not a CFL. Convert the following grammar into CNF. S 1A / 0B A 1AA / 0S / 0 B 0BB / 1S1 / 1 / Write the procedure for constructing a PDA for accepting a language generated by a given context free grammar. Construct PDA for the language generated by the grammar with the following productions. S aABB / aAA A aBB / a B bBB / A Ca For the string aaaaa, show the derivation in the grammar and the moves of the PDA. Construct a TM for checking whether two strings over the alphabet {a, b} are equal or not. Check the TM correctness with the string aba and abb. Briefly explain about counter machines. Find solution to the following MPCP instance. w = (01, 001, 10) x = (011, 01, 00) b) What is a context sensitive grammar? Discuss about the linear bounded automata.

2 3 (a) (b) 4 (a) (b) 5 (a) (b)

7 (a) (b) 8 (a) (b)

*****