UNIVERSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

COURSE FILE
B. Tech CSE- 3rd Year
Semester- 5th

SUBJECT NAME: Formal Language & Automata Theory

SUBJECT CODE: BTCS 502-18

Applicable to: B. Tech CSE (5th sem)
Prepared by: Er. Dinesh kumari
(Assistant Professor)

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Contents of Course file

S. No. Item Page No.

1 Academic Calendar
2 Time Table of the class
3 Time Table of the Teacher
4 Syllabus along with Hours allocated
5 Evaluation Scheme of the course
6 Course Handouts
7 Assignments
8 Quiz/ Class Test
9 MST’s Question Papers
10 University Question Papers of last 2 years
11 Notes/Study material

Name of Teaching Faculty: Dinesh Kumari

Verified by:

HOD:

Principal:

Syllabus

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Course Code : BTCS 502- Course Title: Formal Language & 3L:0T:0P 3Credits
18 Automata Theory

Pre-requisites: Formal Language & Automata Theory

Detailed Contents:
Module 1: Introduction: Alphabet, languages and grammars, productions and derivation,
Chomsky hierarchy of languages.
[4hrs](CO 1)
Module 2: Regular languages and finite automata: Regular expressions and languages,
deterministic finite automata (DFA) and equivalence with regular expressions,
nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and
equivalence with finite automata, properties of regular languages, pumping lemma for regular
languages, minimization off finite automata.
[8hrs](CO 2, 3)
Module 3: Context-free languages and pushdown automata Context-free grammars (CFG)
and languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown
automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma
for context-free languages, deterministic pushdown automata, and closure properties of
CFLs.
[8hrs](CO 4, 5)
Module 4: Context-sensitive languages Context-sensitive grammars (CSG) and languages,
linear bounded automata and equivalence with CSG.
[6hrs](CO 5)
Module 5: Turing machines The basic model for Turing machines (TM), Turing recognizable
(recursively enumerable) and Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterministic TMs and equivalence with
deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMs as
enumerators.
[8hrs](CO 5.6)
Module6: Undecidability Church-Turing thesis, universal Turing machine, the universal and
diagonalization languages, reduction between languages and Rices theorem, undecidable
problems about languages. [8hrs](CO 7)
Suggested books 1. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction
to Automata Theory, Languages, and Computation, Pearson Education Asia.
Suggested reference books: 1. Harry R. Lewis and Christos H. Papadimitriou, Elements of
the Theory of Computation, Pearson Education Asia.
2. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer
Science, Springer.

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

3. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.
4. John Martin, Introduction to Languages and the Theory of Computation, Tata McGraw
Hill.

Evaluation Scheme of the course

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Component 1 Quizzes/Assignments/Class 16
Test/Attendance

Component 2* Sessional Tests (MST) 24

Component 3* End Term Examination** 60

Total 100

Course Handouts

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Pedagogica
Expec Actual l Tool
ted Date (PPT, Suggested
Lectu Lecture
Date of Demonstra Text books/ Remar
re Topic Description
of Delive tion, Case e books/ ks
No.
Delive ry Study, website
ry Black
Board etc)

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 1. Dexter C.
1 Alphabet, Kozen,
languages BBT Automata
Introducti and and
on grammars, Computabil
productions ity,
and Undergradu
derivation, ate Texts in
Computer
Science,
Springer.
2. BBT Dexter C.
1 Chomsky Kozen,
hierarchy of Automata
Introducti languages. and
on Regular Computabil
languages ity,
and finite Undergradu
automata ate Texts in
Computer
Science,
Springer.
3. BBT Dexter C.
1 Chomsky Kozen,
hierarchy of Automata
Introducti languages. and
on Regular Computabil
languages ity,
and finite Undergradu
automata ate Texts in
Computer
Science,
Springer.
4. Regular BBT Dexter C.
Regular expressions Kozen,
languages and Automata
and finite languages, and
automata deterministi Computabil
c finite ity,
automata Undergradu
(DFA) and ate Texts in
equivalence Computer
with regular Science,
expressions, Springer.
5. nondetermi BBT Dexter C.
nistic finite Kozen,
automata Automata
Regular (NFA) and and
languages equivalence Computabil
and finite with DFA, ity,

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 automata regular Undergradu
grammars ate Texts in
and Computer
equivalence Science,
with finite Springer.
automata,
6. nondetermi BBT Dexter C.
nistic finite Kozen,
automata Automata
Regular (NFA) and and
languages equivalence Computabil
and finite with DFA, ity,
automata regular Undergradu
grammars ate Texts in
and Computer
equivalence Science,
with finite Springer.
automata,
7. properties BBT Dexter C.
of regular Kozen,
languages, Automata
Regular pumping and
languages lemma for Computabil
and finite regular ity,
automata languages, Undergradu
minimizatio ate Texts in
n off finite Computer
automata. Science,
Springer.
8. properties BBT Dexter C.
of regular Kozen,
Regular languages, Automata
languages pumping and
and finite lemma for Computabil
automata regular ity,
languages, Undergradu
minimizatio ate Texts in
n off finite Computer
automata. Science,
Springer.
9. nondetermi BBT nondetermi
nistic finite nistic finite
automata automata
Regular (NFA) and (NFA) and
languages equivalence equivalence
and finite with DFA, with DFA,
automata regular regular
grammars grammars
and and
equivalence equivalence

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 with finite with finite
automata, automata,
10. nondetermi BBT nondetermi
nistic finite nistic finite
automata automata
Regular (NFA) and (NFA) and
languages equivalence equivalence
and finite with DFA, with DFA,
automata regular regular
grammars grammars
and and
equivalence equivalence
with finite with finite
automata, automata,
11. nondetermi BBT Dexter C.
nistic Kozen,
pushdown Automata
Context- automata and
free (PDA) and Computabil
languages equivalence ity,
and with CFG, Undergradu
pushdow parse trees, ate Texts in
n ambiguity Computer
in CFG Science,
Springer.
12. automata BBT Dexter C.
Context- Kozen,
Context- free Automata
free grammars and
languages (CFG) and Computabil
and languages ity,
pushdow (CFL), Undergradu
n Chomsky ate Texts in
and Computer
Greibach Science,
normal Springer.
forms,
13. pumping BBT Dexter C.
lemma for Kozen,
Context- context-free Automata
free languages, and
languages deterministi Computabil
and c pushdown ity,
pushdow automata, Undergradu
n closure ate Texts in
properties Computer
of CFLs. Science,
Springer.
14. pumping BBT Dexter C.
lemma for Kozen,

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Context- context-free Automata
free languages, and
languages deterministi Computabil
and c pushdown ity,
pushdow automata, Undergradu
n closure ate Texts in
properties Computer
of CFLs. Science,
Springer.
15. BBT Dexter C.
Kozen,
Context- Context- Automata
sensitive sensitive and
languages grammars Computabil
(CSG) and ity,
languages, Undergradu
ate Texts in
Computer
Science,
Springer.
16. BBT Dexter C.
linear Kozen,
Context- bounded Automata
sensitive automata and
languages and Computabil
equivalence ity,
with CSG. Undergradu
ate Texts in
Computer
Science,
Springer.
17. The basic BBT Dexter C.
model for Kozen,
Turing Turing Automata
machines machines and
(TM), Computabil
Turing ity,
recognizabl Undergradu
e ate Texts in
(recursively Computer
enumerable Science,
) and Springer.
Turing-
decidable
(recursive)
languages
18. BBT Dexter C.
(recursively Kozen,
enumerable Automata
Turing ) and and

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 machines Turing- Computabil
decidable ity,
(recursive) Undergradu
languages ate Texts in
Computer
Science,
Springer.
19. their closure BBT Dexter C.
properties, Kozen,
variants of Automata
Turing and
Turing machines, Computabil
machines nondetermi ity,
nistic TMs Undergradu
and ate Texts in
equivalence Computer
with Science,
deterministi Springer.
c TMs,
20. BBT Dexter C.
nondetermi Kozen,
nistic TMs Automata
Turing and and
machines equivalence Computabil
with ity,
deterministi Undergradu
c TMs, ate Texts in
Computer
Science,
Springer.
21. unrestricted BBT Dexter C.
grammars Kozen,
Turing and Automata
machines equivalence and
with Turing Computabil
machines, ity,
TMs as Undergradu
enumerators ate Texts in
. Computer
Science,
Springer.
22. BBT Dexter C.
equivalence Kozen,
with Turing Automata
Turing machines, and
machines TMs as Computabil
enumerators ity,
. Undergradu
ate Texts in
Computer

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Science,
Springer.
23. BBT Dexter C.
Church- Kozen,
Turing Automata
Undecida thesis, and
bility universal Computabil
Turing ity,
machine Undergradu
ate Texts in
Computer
Science,
Springer.
24. BBT Dexter C.
Kozen,
the Automata
Undecida universal and
bility and Computabil
diagonalizat ity,
ion Undergradu
languages, ate Texts in
Computer
Science,
Springer.
25. reduction BBT Dexter C.
between Kozen,
Undecida languages Automata
bility and Rices and
theorem, Computabil
undecidable ity,
problems Undergradu
about ate Texts in
languages. Computer
Science,
Springer.
26. Undecida undecidable BBT Dexter C.
bility problems Kozen,
about Automata
languages. and
Computabil
ity,
Undergradu
ate Texts in
Computer
Science,
Springer.
27. reduction BBT Dexter C.
between Kozen,
languages Automata
Undecida and Rices and

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 bility theorem, Computabil
undecidable ity,
problems Undergradu
about ate Texts in
languages. Computer
Science,
Springer.
28. reduction BBT Dexter C.
between Kozen,
languages Automata
Undecida and Rices and
bility theorem, Computabil
undecidable ity,
problems Undergradu
about ate Texts in
languages. Computer
Science,
Springer.
29. parse trees, BBT Dexter C.
ambiguity Kozen,
in CFG, Automata
pumping and
introducti lemma for Computabil
on context-free ity,
languages, Undergradu
deterministi ate Texts in
c pushdown Computer
automata, Science,
closure Springer.
properties
of CFLs.
30. parse trees, BBT Dexter C.
introducti ambiguity Kozen,
on in CFG, Automata
pumping and
lemma for Computabil
context-free ity,
languages Undergradu
ate Texts in
Computer
Science,
Springer.
31. pumping BBT Dexter C.
lemma for Kozen,
context-free Automata
introducti languages, and
on deterministi Computabil
c pushdown ity,
automata, Undergradu
closure ate Texts in

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 properties Computer
of CFLs. Science,
Springer.
32. BBT Dexter C.
Kozen,
deterministi Automata
introducti c pushdown and
on automata, Computabil
closure ity,
properties Undergradu
of CFLs. ate Texts in
Computer
Science,
Springer.
33.
Revision

34.
Revision

Designation Name Signature

Course Coordinator Dinesh Kumari

HOD Heena Arora

Principal Dr.Onkar Singh Bhatia

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Date

UNIVERSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

Assignment Sheet Details

Subject Name: Formal Language & Automata Theory

Subject Code: BTCS 502-18

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 Assignmen Date of Last date of
Topics Covered Remarks
t No. Allotment Submission

UNIVERSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

Assignment No 1

Topics Covered:

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

Date of Allotment: Last date of Submission:

UNIVERSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

Assignment No 2

Topics Covered:

Date of Allotment: Last date of Submission:

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

 UNIVERSAL INSTITUTE OF ENGINEERING & TECHNOLOGY

Assignment No 3

Topics Covered:

Prepared by: Dinesh Kumari Verified by (HoD): Principal:

Date of Allotment: Last date of Submission:

Prepared by: Dinesh Kumari Verified by (HoD): Principal: