Professional Documents
Culture Documents
16_Sessional Test_QP
16_Sessional Test_QP
Alle n h o u s e In s titu te o f Te c h n o lo g y
176, Kulgaon Road, Rooma, Kanpur – 208008 U.P.
Cla s s Te s t – I : Eve n S e m e s te r 2023 -24
Program : B. Tech. CSE Semester : IV
Course Name : Theory of Formal Languages Max. Marks : 30
Course Code : KCS-402 Max. Time : 120 Minutes
CO-1 : Analyse and design finite automata, pushdown automata, Turing machines, formal languages,
and grammars
Section – A (CO - 1 ) # Attempt both the questions # 30 Marks
Q.1 : Attempt any Six questions (Short Answer Type). Each question is of 2 marks.
(2 x 6 = 12 Marks)
a) Describe Finite Automata.
b) Write the difference between DFA and NFA
c) What is clean closure? Describe the properties.
d) Write the MYHILL-NERODE theorem
e) Explain Transition diagram and transition table.
f) Write the steps of transformation of NFA to DFA.
g) What is Acceptance of a string by NFA with €-Transitions.
Q.2 : Attempt any Six questions (Medium Answer Type). Each question is of 3 marks.
(3 x 6 = 18 Marks)
a) Design a DFA which accepts the language
L= {w€(0,1)*/ second symbol of w is”0” and fourth input is 1}
b) Design DFA for the language
L= {(01)i12j/i>=1,j>=1}
c) Design DFA for the language
L= { w€(0,1)*/n1(w)/ mod 3 >1}
d) Design a DFA Which accepts the language L = { w/w has both an even no of 0 s and even no of
1s over alphabet ∑ = {0,1} .
e) Convert the following NFA in to DFA
Q
Q Q
2
Start 0
a 1
b
*
a,b
*
a,b * b b
ALLENHOUSE INSTITUTE OF TECHNOLOGY, KANPUR
Q4 1 Q3 1