-
Reg NO.: Name:
APJ ABDUL UNIVERSITY
B.Tech Degree S5 (S,FE) ¢T) (WpmT) Examination May 2025 (2019 S
`-¥1--`-I+`
Course Code: CST 301
rse Name: FORMAL LANGUAGES AND AUTOMATA THEORY
Duration: 3 Hours
PART A
Marks
(Answer all questions; each question carries 3 marks)
I Design a DFA for the language for the set of strings over {a,b}* whose length is 3
divisible by 3.
Write the applications of Finite Automata. 3
Write any three closure properties of regular languages. 3
Write a regular expression for the set of strings whose 5th symbol from the end is b for 3
5 yhill Nerode theorem? List the applications of Myhill Nerode Theorem. 3
6 onstruct a CFG to generate a set of strings with equal number of a's and b's. 3
7 Define Deterministic Pushdown Automata.
8 hat L={anbncn I n>=1 }is not context free using pumping lemma ofcFL. 3
9 d explain the instantaneous description of a Tuning machine.
10 Chomsky Classification of Formal languages.
PART 8
(Answer one fiulL question from each module, each question carries 14 marks)
Module -1
a) Prove that "Let L be a set accepted by a Nondeterministic Finite Automaton. Then 7
exists a deterministic Finite Automaton that accepts L".
Page 1 of 4
1100CST301122102
b) For the following NFA find equivalent DFA and draw the transition diagram of 7
equivalent DFA.
12 a) Let G={V,T,P,S} be a regular grammar where v={S,A,B}, T={0,1,+,-}, S=S 7
Production rules P:
S->OA I lA
A->OA I lA I +81 -a
a->081181011
Construct a Finite Automata that accepts the language generated by a given grammar
G.
b) Write a grammar which generate strings conta.ining even number of `a' and even 7
number of `b' over Z={a,b}.
Module -2
13 a) Construct aNFA accepting the langu by the following regular expression 4
(using Thompson's Construction method).
b(a+b)*aa
b) i) Define ultimate periodicity. Using ultimate periodicity check whether the language 3+7
L = { an! I n>=0} is regular or not.
ii) Construct a regular expression equivalent to the Finite Automata given below:
.-. `. -
Page 2 of 4
1100CST301122102
14 a) Let M be the finite automaton as shown in the flgure. Minimize the automata.
b)i i) What are the conditions needed for pumping lemma for regular sets? 2+4
ii) Prove that L={wwR |w is the element of{0,l}* and wR is the reverse of w} is not
regular using pumping Lemma.
Module -3
15 a) Considerthegrammar
S->aB I bA
A->a I as I bAA
B->b I bs I aBB
For the string `aaabbabbba' give:
i) leftmost derivation
ii) rightmost derivation
iii) derivation tree
iv) Is the grammar ambiguous? Justify your answer.
b) Convert the grammar below to CNF:
S->ASB I €
B->Sbs I A I bb
A->aAS I a
16 a) Convert the following grammar to Greibach Normal Form:
A.r>A{2A;3
A2->A3Ai I b
A3->AiA2 I a
b)- Remove the Useless symbols from the grammar below:
S->aB I acD I aE
B->bc
C->aB I b
D-RE
E->bcD
Page 3 of 4
1100CST301122102
Module -4
17 a) Construct push down Automata to recognize L={anbncm I n,in >= |}. 6
b) Explain two modes of language acceptability ofa PDA and define instantaneous 8
description of PDA.
18 a) Construct apDA equivalentto the grammar. Check whether the grammarcan generate 7
the string `abaaaa' which is accepted by PDA.
S-> aAA
A-> as I bs I a
b) i) List two cFLs which carmot be accepted by DPDA? Justify.
ii) Design PDA which to recognize all palindromes over{0,I }.
Module -5
19 a) Construct a Turing Machine for the language {L=on|n2n|n>=| }.
b) i) Differentiate Nondeterministic Tuning machine and Deterministic Turing Machine. 4+3
ii) Define Multitape turing Machine.
20 a) Explain universal Turing Machine.
b) i) Write short note on Recursive and Recursive enumerable Languages.
ii) Design a Tuning Machine to add two unary integers.
***
Page 4 of 4
