1100csT30tr22204
RegNo.:
APJ ABDUL KALAM TECHNOLOGICAL
B.Tech Degree 55 (R, S) / 55 (PT) (R, S) Examination December
Course Code: CST 301
Course Name: FORMAL LAI\GUAGES AND AUTOMATA THEORY
Max. Marks: 100 Duration:3 Hours
PART A
(Answer oll questions; each question carries 3 marks) Marks
I Draw transition diagram for NFA (without e-moves) for strings starting with '10' 3
or.ll,.p:{0,1}.
2 Design a DFA for strings in which fist and last letters do not match. X: {a, b}. 3
3 Give a regular exprcssion for the set of all strings not containing l0l as a 3
Substring.
4 State the closure properties of regular language. 3
5 Explain with the help of example ambiguous grammar. 3
6 Write CFG equivalent to the regular expression 0* I (0+l )*+1. 3
7 What are the conditions required for push down automata to qualiff as 3
t deterministic push down automata?
8 Can we construct a DPDA for the language wwr? Justifo your answer. 3
.9 Differentiate Recursive and Recurs ively Enumerable Languages. J
'10 O"rt*n a TM to find the I's complement of a binary number. J
*
- PART B.;,
(Answer onefull questionfrom each modale, each question canies 11 marhs)
Module -1
I I a) Construct an c-NFA for the language l-= {Qnlm2P / n,m,p > 0} and convert it into 8
equivalent DFA.
b) Design a DFA for strings in which number of a's is multiple of 3 and number of
b's is multiple of 2.I = {a, b}.
12 a) Draw the state-transition diagram showing an NFA N for the following language
Page 1 of 3
Downloaded from Ktunotes.in
1100csT30t122204
L. Obtain the DFA D equivalent to N by applying the subset construction
algorithm. I
L: {x e {q b} * lx contains 'bab' as a substring}.
b) Construct a regular grammar for L= {0" lll n>l}.Construct deterministic finite
automata for the same.
Module -2
13 a) Find the Regular Expression forthefollowing DFA 7
b b
b) Obtain the minimum state DFA from the following DFA
14 a) Develop equivalent automata for the R.E. (ab.+ b)*(a+bb)*a*. 7
b) Using Pumping Lemma for regular language prove that the language L= 0n is
ln 7
perfect square) is not regular.
Module -3
15 a) State Myhill- Nerode Theorem. Prove the langrngs 1:{6nbn,where p:l is not
Regular using Myhill-Nerode Theorem.
b) convert the grammar {s-rAacb / ABa,A+bAa / a, B+BaB / b, c-c} to cNF
16 a) Convert the Context-Free Grammar with productions: .
{S* aSble} into Greibach Normalform.
b) Convert the Context-Free Grammar with productions:
{S -+ aSalbSblSSle}into ChomskyNormal form.
Module -4
17 a) Deiign a PDA for the language 1= 1 ww'l w €{a,b}* }. Also illustrate the
computation ofthe PDA on the string ,aabbaa,.
b) State Equivalence theorem between empty stack PDA and Final State pDA.
l8 a) Design d PDA for strings in which number of a's is less than number of b's.
Page 2 of3
Downloaded from Ktunotes.in
u0ocsTslt2z2a4
b) Usrng Pumping lennna prove the given language is not cor16xt free. 7
L={at&colwhere n>-1}. I
Modde -5
lg a) Defirr formalty Type O Type l, Type 2 and rype 3 grammar. shm the 7
corr€splding arsomata for each class
b) Design a TM to nnA tne sum of two numbers m and n. Assume that initialty dF tape 7
' contairr m nunrber of 0s folhryed by # fdlowed by n number of 0s
20 a) Design c LinerBounded Automata forthe language L=anbnc
ln>=l | 7
b) Prove that 'Turing Machinc hatting problcm, is undecidable. 7
rl
Page 3 of3
Downloaded from Ktunotes.in
