A 1100csT301122202

Reg No.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNI

Fifth Semester B.Tech Degree Regular and Supplementary Examination

Course Code: CST 301

Course Name: FORMAL LANGUAGES AND AUTOMATA THEORY

Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question corries 3 marles) Marks
Define t-closure of a state? Explain with example. J

Construct a DFA for strings in which first and last leffers do not match. a
J
I: {a, b}
Generate regular expression for strings in which number of a's is a multiple of
three.l={a,b}
4 Explain any 3 closure properties of regular languages J

TRACE KTU
a
5 With suitable example, explain about ambiguous grammar J

6 State Myhill - Nerode Theorem J

7 Whether DPDA and NPDA are equivalent? Justiff your answer J

8 Explain how CFGs can be converted to Chomsky Normal Form J

a
I
9 Define Turing Machine J
a
l0 Differentiate between Recursive and Recursively Enumerable languages J

. -;:- PART B
(Answer onefull quationfrom each module, each question carries 14 morks)

Module -1 ,

ll a) Prove that, if L is accepted by an ordinufltlfa, there exist an equivalent e-NFA

7
that also accepts L
b) Design an NFA (without t-moves) for strings having substring 'bob' . Convert
7
it into equivalent DFA. I = {a, b}
12 a) Construct an e-NFA forthe language L= { tr 1^ 7 /n, m, p20 } and convert it
7
into equivalent NFA without e-transitions
b) Design an NFA (without t-moves) for strings with either consecutive zeros or
7
consecutive ones. Obtain its corresponding DFA

Page 1 of 3
 l1fficsT30tt22m2

Module -2
l3 a) Using pumping lemmf show that L= { dtf / n> 0 } is not regular 7
b) Develop equivalent automata for the Regular Expression (a+hf aabb|s*+bb)- 7
t4 a) Prove that for every Regular Expression 'R', there is an eNFA 'rlf' 7
b) List.out the rules for writing regular expressions. Convert the following DFA to
its equivalent Regular Expression

Module-3
o
15 a) What is Greibach Norrnal Form (GNF)? Convert the following CFG to GNF
S +AA/a, A+SS/b
b) a) Design CFG for the following languages

-(r) Palindromes over {a, b}

(ii)
TRACE KTU
Stings with more than 2 zeros.I = {0, 1}
(iii) (0+r)*(01)*(0+1)"
16 a) Minimize the following DFA using Myhill -Nerode theorern

i-+Siql ':e2;
ii
:QL-*..ql ,q3. 7
ii,!

t42

b) What is Chomsky Normal Form (CNF)? Convert the following pnrductions to

- CNF. S+aSa/bSb/SS/€

Page 2 of 3
 ilwcsT30rI22202

Module -4
17 a) Prove that for every PDA accEpted by final state, there exists an equivalent PDA

accepted by empty stack. ' 7

b) Design PDA for set of even length palindromes over {a, b}. Illustrate the working
7
ryithsuitable example
l8 a) Design PDA for Z= { x € fu, b}* / #o 1x) = fi (x) }.
7
Here #p (x,) represents tlre number of occurrences of the symbol p in the string x
b) Using pumping lemma for CFLs, show that I = { ww / w € {a, b}* } isnot context
7
free.
" Module -5
19 a) Design TM for 1 = {atrbnao / m, n > 0}. Illustrate the working with suitable
-ii 7
example
b) Explain Chomsky hierarchy for formal languages and evaluate various typcs 7
20 a) Design a TM to copy a sking of a's and b's to the right side, leaving one blank
symbol (b) in between. Assume that initially the input tape contains bxb and TM 7
halts with.bxbxb as the ape content. x € {a, b}*
b) undecidable
TRACE KTU
Prove that TM halting problem is 7
***

Page 3 of 3