Course Handout (2024-25 ODD SEMESTER)

: Formal Languages & Automata Theory(BTCS-T-

Subject Name/Code PC-015)
Branch/Sem/Batch :
CEN 5 SEM (A),CSE 5 SEM
(A),CSE 5 SEM (B),CSE 5 SEM
(C),CSE 5 SEM (D),CST 5 SEM
(A)
: Nihar Ranjan Nayak , Kasturi Dhal , Samaleswari Prasad Nayak , Chandan Patra ,
Name of Faculty TOPHAN KUMAR JENA
Scope & Objective -:

The objective of this course is to study the mathematical foundations & abstract models of of computation consisting of automata
theory, formal languages & grammars, computability and concept of Turing machines.

Pre-Requisite -:

Detailed Syllabus:
Module# CO Topics Hours
Introduction: Automata theory, Computability theory,
Complexity theory, Mathematical notations & terminology,
Alphabet, String, Languages & operations on strings; Finite
Automata (Deterministic): Formal definition, Transition
Module-1 CO1 function, Extended transition function, Language of DFA, 9
Design of DFA; Finite Automata (Non-deterministic): Formal
definition, Language of NFA, Equivalence of DFA & NFA; NFA
with Epsilon Transition: Eliminating "-transitions from NFA,
Conversion from Epsilon-NFA to DFA, Minimization of DFA.
Moore Machines, Mealy Machines; Regular Expressions:
Operators and their precedence, Building Regular expressions,
Module-2 CO2 DFA to Regular Expressions, Regular Expressions to DFA, 8
Arden’s theorem, Pumping Lemma for Regular languages,
Closure properties of Regular languages.
Introduction to Grammars: Definition, Derivation of string, Left
and right linear grammars, Regular grammars; Context Free
Grammars: Definition, Derivation of string, Language of CFG,
Module-3 CO3 Parse Tree, Ambiguity in grammar, Elimination of ambiguity, 9
Normal forms of CFG: Chomsky and Greibach normal forms,
Converting CFG to CNF & GNF, Cook, Younger, Kasami
Algorithm, Closure Properties of context free languages.
Push Down Automata: Basic Model, Components, Moves of a
PDA, ID of a PDA, Design of a PDA, PDA to CFG and CFG to
PDA conversion, Pumping Lemma for CFL; Turing Machines:
Module-4 CO4 9
Model, Components, ID of TM, Design of a TM, Variation of TM
model, Recursively Enumerable Languages, Universal Turing
Machine and undecidable problems.
Church Turing hypothesis, Recursive and recursively
enumerable sets, Chomsky’s hierarchy of languages.
Undecidability of Post correspondence problem, Linear
Bounded Automata and Context Sensitive Languages; Primitive
Module-5 CO5 7
Recursive Functions: -Recursive functions, Ackermann’s
function, Turing computable functions, Cantor and Godel
numbering; NP Completeness: P and NP, NP complete and NP
Hard problems.
Total 42 Hours

# Topic Module Chapter Course Coverage No of Classes

 Introduction to Automata Theory and its
1 Module-1 TRUE 1
central concepts
2 Introduction to Finite Automata Module-1 1 TRUE 1
Deterministic Finite Automata, Transition
3 Module-1 TRUE 1
Diagrams and Tables
Extended Transition Function and
4 Module-1 1 TRUE 1
Language of DFA and Examples
5 Non-Deterministic Finite Automata Module-1 TRUE 1
Extended Transition Function and
6 Module-1 1 TRUE 1
Language of NFA and Examples
Equivalence of Deterministic and Non-
7 Module-1 TRUE 1
Deterministic Finite Automata
Used of epsilon Transition, epsilon closure,
8 Extended Transition and Language of e- Module-1 TRUE 1
NFA
Eliminating epsilon transitions and
9 Module-1 1 TRUE 1
Equivalence of DFA and epsilon NFA
Regular Expression operator and its
10 Module-2 TRUE 1
precedence, Building Regular Expression
Converting Regular Expression to e-NFA
11 Module-2 2 TRUE 1
using Thompson construction
12 Algebraic Laws of Regular Expression Module-2 TRUE 1
Converting DFA to Regular Expression
13 Module-2 3 TRUE 1
using Arden's Theorem
Closure Properties of Regular Language
14 Module-2 TRUE 1
(Union and Concatenation)
Closure Properties of Regular Language
15 Module-2 TRUE 1
(star, intersection and others)
16 The Pumping Lemma for Regular Language Module-2 TRUE 1
17 Examples on Pumping Lemma Module-2 2 FALSE 1
18 Equivalence and Minimization of DFA Module-2 TRUE 1
Introduction to Grammars: Definition,
19 Derivation of string, Left and right linear Module-3 TRUE 1
grammars
20 CFG, Parse Trees, Ambiguity in Grammars Module-3 TRUE 1
21 PDA and Language of PDA Module-3 TRUE 1
22 Equivalence of PDA and CFG Module-3 TRUE 1
23 Deterministic Pushdown Automata Module-3 TRUE 1
24 Chomsky Normal Form Module-3 TRUE 1
25 Example on CNF Module-3 3 TRUE 1
26 Greibach Normal Form Module-3 TRUE 1
Pumping Lemma for Context Free Language
27 Module-4 TRUE 1
(CFL)
28 Examples on Pumping Lemma of CFL Module-4 4 FALSE 1
29 Closure Properties for CFL Module-4 TRUE 1
30 Cook, Younger, Kasami Algorithm Module-4 TRUE 1
31 Church Turing Thesis and Turing Machine Module-4 TRUE 1
Instantaneous Descriptions for Turing
32 Module-4 TRUE 1
Machine
33 Transition Diagrams for Turing Machines Module-4 TRUE 1
34 Example of Turing Machine Module-5 5 FALSE 1
35 Extensions to Basic Turing Machine Module-4 TRUE 1
36 Enumerators Module-5 TRUE 1
37 Not Recurively Enumerable Language, Ld Module-5 TRUE 1
Recursively Enumerable Language, The
38 Module-5 TRUE 1
universal Language
Decidable Problems for Regular Language,
39 Module-5 TRUE 1
CFL
40 Reducibility Problems Module-5 TRUE 1
Undecidability of Post correspondence
41 Module-5 TRUE 1
problem
Linear Bounded Automata and Context
42 Module-5 TRUE 1
Sensitive Languages
 Ackermann’s function, Cantor and Godel
43 Module-5 TRUE 1
numbering; NP Completeness
44 Quiz Module-5 FALSE 1
45 Surprise Test Module-4 FALSE 1

Total no. of classes : 45

Text Book
J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 3rd Edition,
Pearson Education, 2007, ., .
P. Linz, An Introduction to Formal Languages and Automata, 4th Edition, Jones & Bartlett Learning, 2006, ., .

Reference Book
M. Sipser, Introduction to the Theory of Computation, 3rd Edition, Cengage Learning, 2012, ., .
J. C. Martin, Introduction to Languages and the Theory of Computation, 4th Edition, Tata McGraw- Hill, 2010, ., .
K. L. P. Mishra, and N. Chandrasekaran, Theory of Computer Science: Automata, Languages and Computation, 3rd Edition, PHI,
2012, ., .
Online Reference Material(s):

1. https://nptel.ac.in/courses/111/103/111103016/: by Dr. K.V. Krishna and Dr. D. Goswami, IIT

Guwahati
2. https://nptel.ac.in/courses/106/106/106106049/: by Prof. K. Krithivasan, IIT Madras
3. https://nptel.ac.in/courses/106/105/106105196/: by Prof. S. Mukhopadhyay, IIT Kharagpur
4. https://www.ics.uci.edu/goodrich/teach/cs162/notes/: by Prof. M. T. Goodrich, University of
California, Irvine, USA

Course Outcome:
Develop and implement mathematical models with DFA, NFA for regular languages and grammar
CO1
for real life applications.
Design and implement grammar and PDA for context free languages and demonstrate their
CO2
properties.
CO3 Construct Turing machines for context sensitive and un-restricted languages.
CO4 Describe the Chomsky hierarchy of Formal Languages and Grammar.
Illustrate the relevance of the Church-Turing thesis, explain the concept of decidability & recursive
CO5
enumerability, and classify a given language to the P, NP or NPC complexity classes.

Program Outcomes Relevent to the Course:

Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems
Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
 Environment and sustainability: Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice.
Individual and team work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the engineering
PO11 and management principles and apply these to one’s own work, as a member and leader in a team,
to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and life-long learning in the broadest context of technological change.

Mapping of CO's to PO's: (1: Low, 2: Medium, 3: High)

PO1 PO2 PO3 PO4 PO5 PO12
CO1 3 2 2 2 1 2
CO2 3 2 3 1 3 2
CO3 3 3 3 2 3 2
CO4 2 3 2 2 2
CO5 2 2 2 3 1