USN:

B.N.M. Institute of Technology

An Autonomous Institution under VTU
Model Question Paper
Fifth Semester BE, 2021-22 Scheme
Automata Theory and Computations – 21AML152
Duration: 3 Hour Max. Marks: 100

Note: 1. Answer one full question from each Module 1,2,3,4,5 (5Q x 20M=100 Marks)

Module 1
Q. Cognitive
Questions Marks CO PO
No Level
1 Define the following with example. i). Alphabet ii). Power
5 CO1 PO1,PSO1 Understand
(a) of an alphabet. iii). Concatenation iv). Language
Define DFSM. Draw a DFSM to accepts
i) decimal strings which are divisible by five.
1 ii) L = {w / w ∈ {a,b}* is the string with odd no. PO1,
10 CO1 Apply
(b) of a’s and even no. of b’s} PSO1
iii) L ={w/ w ∈ {a,b}* is the string of a’s and b’s
and end with the sub string aabb}
1 With a neat diagram, explain a hierarchy of language PO1,
5 CO1 Understand
(c) classes in Automata Theory PSO1
OR

Convert the following NDFSM to its equivalent DFSM

a b
 p {p,q} {p,s}
2 PO1,
q Φ {r} 8 CO1 Apply
(a) PSO1
*r Φ Φ
s t Φ
*t Φ Φ

2 PO1,
Explain finite transducer with an example 4 CO1 Apply
(b) PSO1
Minimize the following DFSM

2 PO1,
8 CO1 Apply
(c) PSO1

Module 2
3 Define Regular expression. Write RE for the following 8 CO2 PO1,PO3, Apply

1
 USN:
(a) Languages PSO1
i) L = {a 2n b 2m | n>=0, m>=1}
ii) L = {w : |w| mod 3 = 0 where w ∈ {a,b}*}
iii) Language of all strings of 0's and l's that has at least
two pair of consecutive 0's
3 State and prove the Pumping Lemma Theorem for Regular PO1,PO3,
8 CO2 Apply
(b) languages. PSO1
3 Construct finite automata for the regular expression PO1,PO3,
4 CO2 Apply
(c) 10+(0+11)0*1 PSO1
OR
Using Kleen's theorem, prove that any language that can be PO1,PO3,
4
defined with a Regular Expression can be accepted by some CO2 Apply
(a) PSO1
FSM.
4 Obtain NDFSM for the Regular expression (a+b)* abb and PO1,PO3,
7 CO2 Apply
(b) (a* + ab) aab* PSO1
4 Prove that the regular languages are closed under PO1,PO3,
5 CO2 Apply
(c) compliment PSO1
Module 3
Define Context Free Grammer. Write the CFG for the
following Languages. PO1,PO2,PO3,
5
(a) i) L={an bn cm: n, m>=0} 8 CO3 PO12, Apply
ii) L={an bn+2 : n>=0} PSO1,PSO2
iii) L={w ∈ {a,b}*: na(w)=nb(w)}
Define Ambiguous Grammar. Show that following PO1,PO2,PO3,
5 grammar is Ambiguous. Apply
6 CO3 PO12,
(b) S-> iCtS | iCtSeS | a
C-> b PSO1,PSO2

PO1,PO2,PO3,
5 Understand
Write a note on parser generators with appropriate example 6 CO3 PO12,
(c)
PSO1,PSO2
OR
Define PDA. Design a PDA for the language that accepts PO1,PO2,PO3,
6
the string with na(w) < nb(w), where w belongs to (a,b)* and 8 CO3 PO12, Apply
(a)
show instantaneous description of PDA on input abbab PSO1,PSO2
Convert the following into CNF:
PO1,PO2,PO3,
6 S -> ASB|E
8 CO3 PO12, Apply
(b) A -> aAS|a
PSO1,PSO2
B -> SBS|A|bb
Write short notes with examples for: PO1,PO2,PO3,
6
i) Topdown parsing 4 CO3 PO12, Understand
(C)
ii) Operator precedence parsing PSO1,PSO2
Module 4
7 PO1,PO2,
With a neat diagram, explain variants of Turing Machines. 10 CO4 Apply
(a) PSO1
Explain Language Acceptability and Design of Turing
7 10 CO4 PO1,PO2, Apply
Machines.

2
 USN:
(b) PSO1
OR
8 Define Turing Machine Model. Explain the representation PO1,PO2,
10 CO4 Apply
(a) of Turing Machines PSO1
PO1,PO2,
8(b) Explain the halting problem and post correspondence problem 10 CO4 Apply
PSO1
Module 5
Write Short notes on PO1,PO2,PO5,
9
i) Growth rate of Function 6 CO5 PO12, Understand
(a)
ii) Classes of P and NP PSO2
PO1,PO2,PO5,
9
Explain how input buffering is implemented 8 CO5 PO12, Apply
(b)
PSO2
PO1,PO2,PO5,
9
Explain the role of lexical analyzer with an example 6 CO5 PO12, Apply
(c)
PSO2
OR
PO1,PO2,PO5,
10
State and explain the Church Turing thesis 8 CO5 PO12, Apply
(a)
PSO2
PO1,PO2,PO5,
10
Define tokens, patterns and lexemes with examples 6 CO5 PO12, Understand
(b)
PSO2
PO1,PO2,PO5,
10 Why 2-buffer technique is used in lexical analyser? Write
6 CO5 PO12, Apply
(c) an algorithm for look ahead code with sentinel
PSO2