REG.

NO

MANIPAL INSTITUTE OF TECHNOLOGY

(Constituent Institute of Manipal University)
MANIPAL-576104

IV SEMESTER B.TECH.(COMPUTER SCIENCE AND ENGINEERING) DEGREE

END-SEMESTER EXAMINATION-MAY 2013
SUBJECT: FORMAL LANGUAGES AND AUTOMATA THEORY (CSE 202)
DATE: 09-05-2013
TIME: 3 HOURS MAX.MARKS: 50
Instructions to Candidates
 Note: Answer any FIVE full questions.

1.A. Explain the following terms

i) Languages ii) Grammars
1.B. Convert the following NFA to its equivalent DFA

1.C. Minimise the states in the following DFA. Clearly show all steps

((1+1) +5+3)
2.A. Obtain a regular expression to accept a language consisting of strings of a’s and b’s
with alternate a’s and b’s
2.B. Find L1/L2 for
L1=L(a*baa*)
L2=L(ab*)

2.C. State and prove Pumping Lemma for Regular languages. Prove that the language
L= {wwR : w Є {a, b}*} is not regular.
(1+4+(1+1.5+2.5))

CSE 202 Page 1 of 2

3.A. Obtain a CFG to generate the set of all strings with no more than three a’s when
Σ ={a, b}
3.B. Is the following grammar ambiguous? Justify
SiCtS / iCtSeS / a
Cb
3.C. Convert the following CFG to Chomsky normal form
SASA / aB
AB / S
Bb / 
(2+3+5)
4.A. With neat transition diagram construct the PDA to accept the language
L={anb2n : n>=1}.
4.B. Obtain the corresponding pushdown automata for the grammar with following
productions using conversion from CFG to PDA procedure.
S  aABC
A  aB/a
B  bA /b
Ca
4.C. Prove that the language L={an! : n>=0} is not context-free language.
(3+4+3)
5.A. Obtain the Turing machine to accept the language
L = {0n1n : n>=1}. And compute the string 0011
5.B. What is the language accepted by the following Turing machine and write the
instantaneous description for the string aba.

5.C. Explain universal Turing machine with neat diagram.

((3.5+1.5)+ (1+1)+3)

6.A. Define Context Sensitive Grammar. Find Context Sensitive Grammar for the
language L = {anbmcndm : n≥1, m≥1}
6.B. Explain Post Correspondence problem. Find whether the following problems have
Post Correspondence (PC) solution:
(i) ∑={0,1} and strings A and B as
w1=101 w2=1001 w3=111
v1=1011 v2=001 v3=111
(ii) ∑={0,1} and strings A and B as
w1=00 w2=0010 w3=1000
v1=000 v2=0110 v3=100
(5+ (2+1.5+1.5))

CSE 202 Page 2 of 2