Course Code : ACT1114 /2012 R-2012 Reg.

No :

GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING (AUTONOMOUS)

Madhurawada, Visakhapatnam
Affiliated to JNT University – K, Kakinada
B.Tech. V-Semester Supplementary Examinations, April-2015
Formal Languages and Automata Theory
(Computer Science and Engineering)

Date : 23-04-2015 Time : 3 Hours Max. Marks : 70

1. Question No. 1 is Compulsory.
2. Answer any FOUR from questions 2 to 8.
3. All parts of a Question must be answered in one place to get valued.

1. Answer the following in 4 or 5 sentences.

a) Differentiate symbol and string. 2 Marks

b) Distinguish NFA and DFA. 2 Marks
c) Define pumping lemma for regular sets. 2 Marks
d) Discriminate RMD and LMD. 2 Marks
e) Distinguish CFG and CFL. 2 Marks
f) What is meant by PDA? 2 Marks
g) Define Turing machine. 2 Marks

2. a) How do you convert ∈-NFA to NFA. Explain through an example. 7 Marks

b) Construct a DFA that accepts equal number of ‘a’s followed by equal number of ‘b’ over 7 Marks
Σ={a,b}. Justify your answer.

3. a) Obtain the Regular expression for the languare L={anbm : (n+m) is even}. 7 Marks
b) Show that the language L={ap: p is prime} is not regular. 7 Marks

4. a) Construct LMD and RMD for the string ‘aabbaa’ from the grammar 7 Marks
S → aAS / a; A → SbA / SS / ba
b) Construct left linear and right linear grammars for the language (0+1)*00(0+1)*. 7 Marks

5. a) Minimize the following automata 7 Marks

7 Marks
b) Distinguish CNF and GNF.

Page 1 of 2
Course Code : ACT1114 /2012 R-2012 Reg. No :

6. a) Convert the following grammar to PDA that accepts the same language by empty stack 7 Marks
S → Aaa; A → aS / bS / a
b) Construct a PDA to accept the language L={aibi : i≥1}. 7 Marks

7. a) Discuss “Types of Turing Machines”. 7 Marks

b) Explain briefly ‘church’s hypothesis’. 7 Marks

8 a) Write a short notes on “Linear Bounded Automata and context sensitive languages”. 7 Marks
b) Writ about ‘Universal Turing Machine’. 7 Marks

* * *

Page 2 of 2