A 11CST3011222011100CST301122101 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
B.Tech Degree S5 (S, FE) / S5 (PT) (S) Examination June 2024 (2019 Scheme)

Course Code: CST 301

Course Name: FORMAL LANGUAGES AND AUTOMATA THEORY
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks
1 Draw transition diagram for NFA (with or without є-moves) for strings starting
3
with ‘10’ or ‘11’. ∑ = {0,1}
2 Define the language acceptability by DFA, NFA and Ɛ-NFA 3
3 Write down the regular expression for strings with even number of a’s.
3
∑ = {a, b}
4 How can we identify two equivalent states in a DFA? 3
5 Is the grammar ‘E → E+E / E*E / a’ ambiguous? Justify your answer. 3
6 State Myhill - Nerode Theorem 3
7 Differentiate between DPDA and NPDA 3
8 List out the transition rules ‘δ’ used to convert given CFG G to its equivalent
3
NPDA M.
9 Explain how Turing Machine differs from PDA. 3
10 Why TM model is widely accepted and considered as a general model for
3
computers?
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) Prove that for every NFA M, there exist an equivalent DFA M’ 7
b) Design an NFA (without Ɛ-moves) for strings ending with ‘01’. Convert it into
7
equivalent DFA. ∑ = {0, 1}
12 a) Draw the transition diagram of DFA for L = { baxb / x Є {a, b}* } and obtain its
7
regular grammar

Page 1 of 3
 11CST3011222011100CST301122101

b) Prove that, if L is accepted by an ordinary NFA, there exist an equivalent є-NFA

7
that also accepts L
Module -2
13 a) Obtain the regular expression equivalent to the following DFA

b) Develop equivalent automata for the Regular Expression (ab+b)*(a+bb)*a* 7

14 a) Prove that for every Regular Expression ‘R’, there is an є-NFA ‘M’ 7
b) Using pumping lemma, show that L= { ap /p is a prime number } is not regular 7
Module -3
15 a) What is Greibach Normal Form (GNF)? Convert the following CFG to GNF
7
S → ABA, A → aA / Ɛ, B → bB / Ɛ
b) a) Design CFG for the following languages
(i) L= { wcwR / w Є {a, b}* } where wR represents reverse of w
7
(ii) Stings with exactly 2 zeros. ∑ = {0, 1}
(iii) (011+1)*(01)*
16 a) Minimize the following DFA using Myhill – Nerode theorem

b) Show the equivalence classes of Canonical Myhill – Nerode relation for the
7
languages of binary strings with odd number of zeros and even number of ones.
Module -4
17 a) Prove that for every PDA accepted by empty stack, there exists an equivalent
7
PDA accepted by final state.
b) Design PDA for L = { ai bj ck / k = i + j }. Illustrate the working for the string
7
‘aabbcccc’

Page 2 of 3
 11CST3011222011100CST301122101

18 a) Design PDA for L= { wwR / w Є {a, b}* }. 7

b) State and prove any three closure properties of Context Free Languages. 7
Module -5
19 a) Design TM for L = { anbn / n > 0 }. Trace out the working for the input string
7
‘aabb’
b) Explain Chomsky hierarchy for formal languages and evaluate various types 7
20 a) Design a TM to copy a block of zeros to the right side, leaving one blank symbol
(b) in between. Assume that initially the input tape contains b0nb and TM halts 7
with b0nb0nb as the tape content.
b) Explain the working of Universal Turing Machine with its encoding scheme 7
***

Page 3 of 3