ALLENHOUSE INSTITUTE OF TECHNOLOGY, KANPUR

ALLENHOUSE INSTITUTE OF TECHNOLOGY (Polytechnic), KANPUR

Program: B. Tech. Subject Name and Code: -(KCS402) Theory of Automata and
Formal Languages
Branch: CSE/CS [AIML] Year: Second Semester: Fourth
Exam: CT-2/ Session 2022 Name of Faculty: Apoorv Mishra
Time:120 Mins Max. Marks: 30

Section: A Marks CO
Attempt all questions. Write the answer of each question in short. (1*6 = 6)

1. What is a regular expression? 1 CO2

2. Construct a DFA for the regular expression (00*+11*)* 1 CO2

Differentiate
3. (i)ℇ and ϕ. 1 CO2
(ii)* and +

4. Define Grammer in reference to TOC. 1 CO3

Write the regular expression for the language

5. 1 CO2
L={anbm : (n+m) is even}

6. State whether the language L={xnynzn |n>=1}is a context free or not with explanation. 1 CO3

Section: B
Attempt all questions. (3*4 = 12)

Explain Chomsky
7. hierarchy in detail 3 CO3
with diagram.

Construct a PDA to
8. accept L={0n 1n | 3 CO4
n>= 0}.
9. State and prove
3 CO2
Arden’s Theorem .
10. Write the regular
expression for the
language 3 CO2
L={anbm : (n+m)
is even}

Section :C
Attempt all questions. (4*3 = 12)
11. Construct a PDA from the following CFG. 4 CO4
 ALLENHOUSE INSTITUTE OF TECHNOLOGY, KANPUR

ALLENHOUSE INSTITUTE OF TECHNOLOGY (Polytechnic), KANPUR

G=({S,X},{a,b},P,S) where the productions are –

S🡪 XS|ℇ ,
A 🡪aXb | Ab | ab

12. Construct a PDA that accepts L={wwR | w=(a+b)*} 4 CO4

13. Find the Regular Expression corresponding to given figure using Arden’s Theorem

4 CO2

Course Outcomes of Course Code:

CO-1 Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and grammars

CO-2 Analyse and design, Turing machines, formal languages, and grammars

Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and complexity
CO-3
through problem solving

CO-4 Prove the basic results of the Theory of Computation.

CO-5 State and explain the relevance of the Church-Turing thesis