1.

Course Description

The course introduces on fundamental concepts of Computer science and formal methods of computation like
automata theory and formal languages including grammar, finite automaton, regular expression, formal
language, pushdown automaton, and Turing machine. Not only do they form basic models of computation, they
are also the foundation of many branches of computer science, e.g. compilers, software engineering, concurrent
systems, etc. The properties of these models will be studied and various rigorous techniques for analyzing and
comparing them will be discussed, by using both formalism and examples.

2. Aim
 Study various automata, such as deterministic and nondeterministic finite-state machines, pushdown
automata, and Turing machines.
 Study formal languages of different kinds, such as regular and context-free languages.
 Understand the connections between languages and automata, and related algorithms for transformations.
 Understand the basic results on computability, including undecidable problems such as the halting and Post
correspondence problems, and their significance.
 Study the basics of intractability, including NP-completeness and related topics.
 Make connections between theoretical results and topics in practical software development, such as finite
automata and regular-expression libraries.
 Improve programming skills, with emphasis on connections between theoretical results and practical
software.
3. Instructional Objectives

The objective of this course is to classify machines by their power to recognize languages and comprehend the
hierarchy of problems arising in the computer sciences

4. Learning Outcomes
 Make use of Finite State Machines for Modeling and Solving computing problems for different
languages
 Construct regular expressions for different languages
 Model Push Down Automata for CFLs and constructs a PDA for different CFLs
 Make use of Context-Free languages and Turing Machines for different unrestricted languages
5. Module Description

CO1: Introducing the concepts of automata theory Understand NFA and DFA Conversions and Equivalence of Different
finite automata

CO2: Introducing the concepts of Regular Languages Understand Pumping lemma of regular sets, closure properties of
regular sets Equivalence between regular linear grammar and FA, interconversion.

CO3: Introducing the concepts of Context-Free Grammars Understanding Chomsky Normal Form (CNF) and Greibach
Normal Form (GNF) Push down automata model and its equivalence

CO4: Introducing the concepts of Types of PDA Understand Turing Machine Concepts Counter machine and Restricted
Turing Machines

Session Introduction: This Session mainly focuses on the Course introduction, i.e, the Syllabus, Session plan,
Tutorial Plan, and Evaluation Components.
 • Introduce the syllabus contents

• The Plans of Delivery of Lecture and Tutorial

• The Evaluation Components

Session Description:

K L Deemed to be University
Department of Computer Science and Engineering -- KLVZA Course
Handout
2022-2023, EVEN Sem
Course Title :AUTOMATA THEORY AND FORMAL LANGUAGES

Course Code :21CS2215RB

L-T-P-S Structure : 2-1-0-0

Pre-requisite :

Credits :3

Course Coordinator :Jampani Satish Babu

Team of Instructors :

Teaching Associates :

Syllabus:

Finite Automata and Regular Languages: Introduction, Deterministic Finite Automata, Non-Deterministic Finite
Automata, and equivalence.

Regular Expression: Regular Expression and its equivalence with Finite Automata, Minimization of Finite Automata.
Introduction to Grammar, Regular Grammar, Pumping Lemma for Regular sets, properties of regular languages.

Context Free Grammar: Context Free Grammar (CFG), Derivation Trees, Ambiguity, Simplification of CFG. Normal
Forms—CNF and GNF.

Pushdown Automata: Push Down Automata, CFG-PDA equivalence, Pumping Lemma for CFL and properties of CFL.

Turing Machines: Turing machine model, techniques for Turing machine construction, Turing machines as language
acceptor, combining Turing machines, properties of recursive and recursively enumerable languages, Universal
Turing Machine, Chomsky Hierarchy and Halting Problem.

Text Books :

T1. John E. Hopcroft, Rajeev Motwani, and Jeffery D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, 3rd Edition, Pearson Education, 2008.
T2. Linz, Peter, “An Introduction to Formal Languages and Automata”, Sixth Edition—2016,Jones and Bartlett.

Reference Books :

R1. Sipser J Michael, “Introduction to Theory of Computation”, Third Edition—2015, Cengage.

R2. Martin Jhon, “Introduction to Languages and Theory of Computation”, Third Edition—2016, PHI.

Web Links :
1. Theory Of Computation and Automata Tutorials: https://www.geeksforgeeks.org/theory-of-
computation-automata-tutorials/
2. Automata Tutorial: https://www.javatpoint.com/automata-tutorial
3. Automata Theory Tutorial: https://www.tutorialspoint.com/automata_theory/index.htm
4. Automata Tutorial: https://www.tutorialandexample.com/automata-tutorial
MOOCs :
1. INTRODUCTION TO THE THEORY OF COMPUTING:
https://www.coursera.org/lecture/cs-algorithms-theory-machines/overview-7Fk8M
2. Formal Languages and Automata Theory: https://www.udemy.com/course/formal-languages-and-
automata-theory-e/
3. Formal Languages and Automata Theory: https://nptel.ac.in/courses/111103016 4. Formal Languages and
Automata Theory: https://www.virtulearn.in/course/formal-languages-and-automata-theory-online-videos
 Course Rationale :This course introduces some fundamental concepts in automata theory and formal
languages including grammar, finite automaton, regular expression, formal language, pushdown automaton,
and Turing machine. Not only do they form basic models of computation, they are also the foundation of
many branches of computer science, e.g. compilers, software engineering, concurrent systems, etc. The
properties of these models will be studied and various rigorous techniques for analyzing and comparing
them will be discussed, by using both formalism and examples.
Course Objectives :The objective of this course is to classify machines by their power to recognize
languages and Comprehend the hierarchy of problems arising in the computer sciences

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Make use of Finite State Machines for Modeling and Solving
CO1 PO1,PO5 3
computing problems for different languages
CO2 Construct regular expressions for different languages PO3 3
Model Push Down Automata for CFLs and constructs a PDA
CO3 PO4,PO5 3
for different CFLs
Make use of Context-Free languages and Turing Machines
CO4 PO4,PO5 3
for different unrestricted languages

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3
No. BTL
Btl-3
Btl-1
Btl-2 Conversions and
CO1 3 Introducing the concepts of
Understand NFA and DFA Equivalence of Different
automata theory
finite automata
Btl-2 Btl-3
Btl-1
Understand Pumping lemma Equivalence between
CO2 3 Introducing the concepts of
of regular sets, closure regular linear grammar and
Regular Languages
properties of regular sets FA, interconversion.
Btl-2
Btl-1 Understanding Chomsky Btl-3
CO3 3 Introducing the concepts of Normal Form (CNF) and Push down automata model
Context-Free Grammars Greibach Normal Form and its equivalence
(GNF)
Btl-1 Btl-2 Btl-3
CO4 3 Introducing the concepts of Understand Turing Machine Counter machine and
Types of PDA Concepts Restricted Turing Machines

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems.
PO2 Problem Analysis: Identify, formulate, review research literature, and analyse complex
engineering 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
including design of experiments, analysis and interpretation of data, and synthesis of the information
PO4
to provide valid conclusions for complex problems that cannot be solved by straightforward
application of knowledge, theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modelling to complex engineering activities with
an understanding of the limitations.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal,
PO6 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
PO9
in 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
PO12
in independent and lifelong learning in the broadest context of technological change.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.

Lecture Course DELIVERY Plan:

Book No[CH Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Methods

ALM,Home
Assignment, ,SEM-
COI- Course Handout,
1 CO1 T1 Chalk,PPT,Talk
1 Overview of AFL
EXAM1,Tutorial

Importance of FA,
Fundamentals:
ALM,End Semester
COI- Strings, Alphabet, T BOOK [1],
2 CO1 Chalk,PPT,Talk Exam,SEM-
1 Language, and Page no 45-53
EXAM1,Tutorial
Finite state machine
definitions.
 Book No[CH Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Methods

An Informal Picture ALM,End Semester

of Finite Automata, Exam,Home
COI- finite automaton T Book [2], Assignment, ,SEM-
3 CO1 Chalk,LTC,PPT,Talk
2 model, acceptance page no-73-74 EXAM1,Tutorial
of strings, and
languages

Informal Picture of ALM,ATTN,End

Deterministic Finite Semester Exam,Home
COI- Automata, Non Text Book [1], Assignment, ,SEM-
4 CO1 Chalk,LTC,PPT,Talk
2 Deterministic Finite page no; 45-65 EXAM1,Tutorial
Automata & its
Problems

ALM,ATTN,End
NFA with Є
Semester Exam,Home
transitions -
COI- Text Book Assignment, ,SEM-
5 CO1 Significance, Chalk,LTC,PPT,Talk
3 [1], page EXAM1,Tutorial
acceptance of
no:72-79
languages.

Equivalence
ALM,ATTN,End
between NFA with
Semester Exam,Home
and without Є Text Book[2],
COI- Assignment, ,SEM-
6 CO1 transitions, NFA to page no: 146- Chalk,LTC,PPT,Talk
3 EXAM1,Tutorial
DFA conversion 147,91

ALM,ATTN,End
Semester Exam,Home
Regular sets, regular
COI- Text Book [2], Assignment, ,SEM-
7 CO2 expressions, identity Chalk,LTC,PPT,Talk
1 Page no: 85-91 EXAM1,Tutorial
rules

ALM,ATTN,End
Conversion finite Semester Exam,Home
Text
COI- Automata for a Assignment, ,SEM-
8 CO2 Book[1],Page Chalk,LTC,PPT,Talk
1 given regular EXAM1,Tutorial
no:102-106
expression.
 Book No[CH Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Methods

ALM,ATTN,End
Conversion of Semester Exam,Home
Text
COI- Finite Automata to Assignment, ,SEM-
9 CO2 Book[1],Page Chalk,LTC,PPT,Talk
2 Regular EXAM1,Tutorial
no:102-106
expressions.

CO2 COI- minimization of

2 FSM Text Book[2],
page no: 146- ALM,ATTN,End
147,91 Semester Exam,Home
Chalk,LTC,PPT,Talk Assignment, ,SEM-
EXAM1,Tutorial

ALM,ATTN,End
Pumping lemma of Semester Exam,Home
Text Book[1],
COI- regular sets, closure Assignment, ,SEM-
10 CO2 Page No: 162- Chalk,LTC,PPT,Talk
2 properties of regular EXAM1,Tutorial
166
sets

ALM,ATTN,End
Semester Exam,Home
Regular grammars-
COI- Text Book[R4], Assignment, ,SEM-
11 CO2 right linear and left Chalk,LTC,PPT,Talk
3 Page no: 3.3 EXAM1,Tutorial
linear grammars

ALM,ATTN,End
Semester Exam,Home
Equivalence
Assignment, ,Peer-
COI- between regular Text Book[R4],
12 CO2 Chalk,LTC,PPT,Talk Review,SEM-
3 linear grammar and Page no: 3.3
EXAM1,SemIn-Makeup
FA, interconversion.
Test 1,Tutorial

Context-free ALM,ATTN,End
grammar, derivation Semester Exam,Home
Text Book[1],
COI- trees, sentential Assignment, ,SEM-
14 CO3 page no: 171- Chalk,LTC,PPT,Talk
1 forms. Rightmost EXAM2,Tutorial
182
and leftmost
derivation of strings

Ambiguity in a ALM,ATTN,End
context-free Semester Exam,Home
Text Book[1],
COI- grammar. Assignment, ,SEM-
15 CO3 Page No: 188- Chalk,LTC,PPT,Talk
1 Minimization of EXAM2,Tutorial
200
Context-Free
Grammars.
 ALM,ATTN,End
Semester Exam,Home
Chomsky Normal
Text Assignment, ,SEM-
COI- Form (CNF),
16 CO3 Book[2],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
2 Greibach Normal
No:201-202 Test 2,Tutorial
Form (GNF)
 Book No[CH Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Methods

ALM,ATTN,End
Pumping Lemma Semester Exam,Home
for Context-Free Text Book Assignment, ,SEM-
COI-
17 CO3 Languages. [2],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
2
Enumeration of no:213-217 Test 2,Tutorial
properties of CFL.

ALM,ATTN,End
Semester Exam, ,
Push down Text
COI- Review,SEM-
18 CO3 automata, Book[1],Page Chalk,LTC,PPT,Talk
3 EXAM2,SemIn-Makeup
definition, model no:221-229
Test 2,Tutorial

ALM,ATTN,End
Acceptance of CFL, Semester Exam,Home
Acceptance by final Text Assignment, ,SEM-
COI-
19 CO3 state, and Book[1],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
3
acceptance by no 233-235 Test 2,Tutorial
empty state

ALM,ATTN,End
Semester Exam,Home
Text Assignment, ,SEM-
COI- Equivalence of
20 CO3 Book[1],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
3 PDA
no:236 Test 2,Tutorial

ALM,ATTN,End
Semester Exam,Home
Text Book[1],
COI- Assignment, ,SEM-
21 CO4 Types of PDA Page No:243- Chalk,LTC,PPT,Talk
1 EXAM2,Tutorial
247

ALM,ATTN,End
Semester Exam,Home
Equivalence of CFL Text Assignment, ,SEM-
COI-
22 CO4 and PDA, Book[1],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
1
interconversion. No:243-247 Test 2,Tutorial
 Book No[CH Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Methods

ALM,ATTN,End
Turing Machine, Semester Exam,Home
definition, model, Text Assignment, ,SEM-
COI-
23 CO4 design of TM, Book[2],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
2
Turing Machine No:278-281 Test 2,Tutorial
for different
languages

ALM,ATTN,End
Turing Machine for Semester Exam,Home
different languages, Text Assignment, ,SEM-
COI-
24 CO4 Turing Machine for Book[R1],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
2
unrestricted No:179 Test 2,Tutorial
languages.

Computable
ALM,ATTN,Home
functions,
Assignment, ,SEM-
recursively Text Book[2],
COI- EXAM2,SemIn-Makeup
25 CO4 enumerable Page No:309- Chalk,LTC,PPT,Talk
3 Test 2,Tutorial
languages. Church’s 321
hypothesis, counter
machine.

ALM,ATTN,End
Semester Exam,Home
Extensions to TM, Text Assignment, ,SEM-
COI-
26 CO4 and Restricted Book[1],Page Chalk,LTC,PPT,Talk EXAM2,SemIn-Makeup
3
Turing Machines. NO:358 Test 2,Tutorial

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 The Student will be able to understand the overview of the subject
and its evaluation components

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
25 Course Handout 1 Talk APPLICABLE
---
--- NOT
20 Overview of AFL 1 Talk APPLICABLE
---
SESSION NUMBER : 2
Session Outcome: 2 Introduced to the concept of the Importance of FA and its representation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
Fundamentals: Strings, Alphabet, Language, and Finite
20 2 Chalk APPLICABLE
state machine definitions.
---
Quiz/Test
5 Participate/verify 1 Chalk
Questions
--- NOT
20 Preliminary mathematics for representing FA 2 Chalk APPLICABLE
---
Quiz/Test
5 Verify 1 Chalk
Questions
--- NOT
5 Concluding FA introduction 1 Chalk APPLICABLE
---

SESSION NUMBER : 3
Session Outcome: 1 introduced to the concept of An Informal Picture of Finite Automata

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
An Informal Picture of Finite Automata, finite
20 2 Talk APPLICABLE
automaton model,
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
10 Acceptance of strings, and languages 2 Chalk APPLICABLE
---
--- NOT
10 Concluding FA introduction 2 Chalk APPLICABLE
---

SESSION NUMBER : 4
Session Outcome: 1 The Student will be introduced to the concept of Deterministic Finite
Automata and to will be able to design DFA, NFA
 Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
5 Attendence 1 Talk --- NOT
APPLICABLE
---
--- NOT
Deterministic Finite Automata and Non Deterministic
20 2 Chalk APPLICABLE
Finite Automata
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
10 Construct DFA 6 Chalk APPLICABLE
---
--- NOT
10 Construct NFA 6 Chalk APPLICABLE
---

SESSION NUMBER : 5
Session Outcome: 5 The Student will be design NFA with Є transitions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 NFA with Є transitions 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
Construct NFA with Є transitions
20 6 Chalk APPLICABLE
Significance, acceptance of languages.
---

SESSION NUMBER : 6
Session Outcome: 6 The student will be able to Convert NFA with € transitions to NFA
without € transitions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Chalk APPLICABLE
---
--- NOT
Equivalence between NFA with and without
20 2 Chalk APPLICABLE
Є transitions
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
10 NFA to DFA conversion 2 Chalk APPLICABLE
---
10 minimization of FSM 2 Chalk --- NOT
APPLICABLE
 ---

SESSION NUMBER : 7
Session Outcome: 7 The student will be able to design Equivalence between two FSMs

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Equivalence between two FSMs 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 Chalk
Questions
--- NOT
Finite Automata with output- Moore and Melay
20 2 Chalk APPLICABLE
machines.
---

SESSION NUMBER : 8
Session Outcome: 8 The student will be able to understand Regular Expressions and the
simplification of Regular Expressions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Regular sets, regular expressions, identity rules 2 Talk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Conclusion of Regular Expressions 2 Chalk APPLICABLE
---

SESSION NUMBER : 9
Session Outcome: 1 The student will be able to Convert finite Automata for a given Regular
Expression

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
 --- NOT
Conversion finite Automata for a given regular
20 2 Chalk APPLICABLE
expression.
---
5 Participate/verify 3 LTC Quiz/Test
 Questions
--- NOT
Problems on Conversion finite Automata for a given
20 2 Chalk APPLICABLE
regular expression.
---

SESSION NUMBER : 10

Session Outcome: 1 The student will be able to derive regular expressions using Finite
Automaton

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Conversion of Finite Automata to Regular expressions. 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
Problems on Conversion of Finite Automata to Regular
20 2 Talk APPLICABLE
expressions.
---

SESSION NUMBER : 11

Session Outcome: 1 The student will be able to understand Pumping Lemma of

Regular Sets, Closure Properties of Regular Sets

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Pumping lemma of regular sets 2 Talk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 closure properties of regular sets 2 Talk APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 1 The student will be able to derive a string from a CFG and
construct context-free language
 Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
20 Regular grammars-right linear 2 Chalk --- NOT
APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 left linear grammars 2 Chalk APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 1 The student will be able to Construct Equivalence between regular
linear grammar and FA

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Equivalence between regular linear grammar and FA 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 4 LTC
Questions
--- NOT
20 problems on Interconversion. 2 Chalk APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 1 The student will be able to understand Context-Free Grammar,

derivation trees, and sentential forms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Context-free grammar 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
10 Derivation trees, sentential forms 2 Chalk APPLICABLE
---
--- NOT
10 Rightmost and leftmost derivation of strings 2 Chalk APPLICABLE
---

SESSION NUMBER : 15
Session Outcome: 1 The student will be able to derive a string from a CFG and
construct context-free language

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Ambiguity in a context-free grammar 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Minimization of Context-Free Grammars 2 Chalk APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 1 The student will be able to understand the conversion of CFG into a
Normal Form: Chomsky Normal Form

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Chomsky Normal Form (CNF) 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Greibach Normal Form (GNF) 2 Chalk APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 1 The student will be able to understand Pumping Lemma for Context-
Free Languages, Enumeration of properties of CFL.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Pumping Lemma for Context-Free Languages 2 Chalk APPLICABLE
---
 Quiz/Test
5 Participate/verify 3 LTC
Questions
20 Enumeration of properties of CFL. 2 Chalk --- NOT
APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 1 The student will be able to understand PDA, representation of PDA,
and mathematical form of PDA

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Push down automata 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Definition, model 2 Chalk APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 1 The student will be able to Design Pushdown automata Acceptance by
Final state, and Acceptance by an Empty state

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Acceptance of CFL 2 Talk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Acceptance by final state, and acceptance by empty state 2 Chalk APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 1 The student will be able to Design DPDA for some languages

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
 --- NOT
5 Attendence 1 Talk APPLICABLE
---
20 Equivalence of PDA 2 Chalk --- NOT
 APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Problems on Equivalence of PDA 2 Chalk APPLICABLE
---

SESSION NUMBER : 21

Session Outcome: 1 The student will be able to Design DPDA and NPDA for some languages

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 DPDA 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 NPDA 2 Chalk APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 1 The student will be able to apply the procedure to convert PDA to CFLs
and vice versa

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Equivalence of CFL and PDA 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Interconversion 2 Chalk APPLICABLE
---

SESSION NUMBER : 23

Session Outcome: 1 The student will be able to understand Turing Machine and its
mathematical representation
 Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
5 Attendence 1 Talk --- NOT
 APPLICABLE
---
--- NOT
20 Turing Machine, definition, model 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 design of TM, Turing Machine for different languages 2 Chalk APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 1 The student will be able to Design Turing Machine for Unrestricted
Languages

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Turing Machine for different languages 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Turing Machine for unrestricted languages. 2 Chalk APPLICABLE
---

SESSION NUMBER : 25

Session Outcome: 1 The student will be able to Understand Computable functions

and recursively enumerable

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
Computable functions, recursively enumerable
20 2 Chalk APPLICABLE
languages
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Church’s hypothesis, counter machine. 2 Talk APPLICABLE
---

SESSION NUMBER : 26
Session Outcome: 1 The student will be able to design Restricted Turing Machine

Time(min) Topic BTL Teaching- Active

 Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
--- NOT
20 Extensions to TM 2 Chalk APPLICABLE
---
Quiz/Test
5 Participate/verify 3 LTC
Questions
--- NOT
20 Restricted Turing Machines 2 Chalk APPLICABLE
---

Tutorial Course DELIVERY Plan:

List of Experiments supposed to finish in Open Lab Sessions:

Lab
session List of Experiments CO-Mapping
no

Construct Deterministic Finite Automata and Non-Deterministic Finite

1 CO1
Automata

2 Convert NFA with € transitions to NFA without € transitions CO1

3 NFA to DFA conversion, Construct Finite Automata with output CO1

4 Conversion finite Automata for a given regular expression CO2

5 Conversion of Regular Grammar CO2

6 Construct Rightmost and leftmost derivation of strings CO2

7 Chomsky Normal Form (CNF) CO3

8 Greibach Normal Form (GNF) CO3

Deterministic Push-Down Automata (DPDA) and Non-Deterministic Push-

9 CO3
Down Automata (NPDA)

10 Turing Machine for different languages CO4

11 Computable functions, recursively enumerable languages CO4

12 Problems on PDA, TM CO4

13 Problems on TM CO4

Tutorial Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Construct Deterministic Finite Automata and Non-Deterministic Finite

Automata

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Construct DFA and NFA 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 2
Session Outcome: 1 Convert NFA with € transitions to NFA without € transitions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Convert NFA with € transitions to NFA without Quiz/Test
25 6 LTC
€ transitions Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 3
Session Outcome: 3 Construct Finite Automata with output

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
NFA to DFA conversion, Construct Finite Quiz/Test
25 6 LTC
Automata with output Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 4
Session Outcome: 1 Conversion finite Automata for a given regular expression
 Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
25 Conversion finite Automata for a given regular 6 LTC Quiz/Test
expression Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 5
Session Outcome: 1 Conversion of Regular Grammar

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Conversion of Regular Grammar 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 6
Session Outcome: 1 Construct Rightmost and leftmost derivation of strings

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Construct Rightmost and leftmost derivation of strings 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 7
Session Outcome: 1 Chomsky Normal Form (CNF)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Chomsky Normal Form (CNF) 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 8
Session Outcome: 1 Greibach Normal Form (GNF)

Time(min) Topic BTL Teaching- Active

 Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Greibach Normal Form (GNF) 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 9
Session Outcome: 1 Construct PDAs

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Deterministic Push-Down Automata (DPDA) and Non- Quiz/Test
25 6 LTC
Deterministic Push-Down Automata (NPDA) Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 10

Session Outcome: 1 Construct Turing Machine for different languages

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Chalk APPLICABLE
---
Quiz/Test
25 Turing Machine for different languages 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 11

Session Outcome: 1 Computable functions, recursively enumerable languages

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
 Computable functions, recursively enumerable Quiz/Test
25 6 LTC
languages Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions
SESSION NUMBER : 12

Session Outcome: 1 Construction of Problems on PDA,TM

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Problems on PDA,TM 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

SESSION NUMBER : 13

Session Outcome: 1 Problems On TM

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendence 1 Talk APPLICABLE
---
Quiz/Test
25 Problems on TM 6 LTC
Questions
Quiz/Test
20 Problem Solving 6 LTC
Questions

Practical Course DELIVERY Plan: NO Delivery Plan Exists

Practical Session wise Teaching – Learning Plan

No Session Plans Exists
Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES

etc:

Assignment Assignment
Week Topic Details co
Type No
COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
Mon Theory --- --- V-S1,V-S2 V-S1,V-S2 --- --- --- V-S3,V-S4 V-S3,V-S4
 Tutorial --- --- -- -- --- --- --- -- --
Lab --- --- -- -- --- --- --- -- --
Skilling --- --- -- -- --- --- --- -- --
Theory --- --- -- --- --- --- --- -- ---
Tutorial --- --- V-S1,V-S2 --- --- --- --- V-S3,V-S4 ---
Tue
Lab --- --- -- --- --- --- --- -- ---
Skilling --- --- -- --- --- --- --- -- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Wed
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Thu
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Fri
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sat
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sun
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and
discussions that would be planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would
be planned, and schedule notified accordingly.
Advanced Topics, Additional Reading,
S.no CO ALM References/
Research papers and any
EVALUATION PLAN:

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4
Type Component Dates (Hours)
End
Semester Weightage 40 10 10 10 10
Summative
End Semester Exam 180
Evaluation
Total= 40 Max Marks 100 25 25 25 25
%

In Semester Weightage 8 2 2 2 2
Formative ALM Max Marks 40
120
10 10 10 10
Evaluation
Weightage 7 1.75 1.75 1.75 1.75
Total= 25 Tutorial 120
% Max Marks 100 25 25 25 25
Home Assignment Weightage 10 2.5 2.5 2.5 2.5
120
and Textbook Max Marks 40 10 10 10 10
Weightage 17.5 8.75 8.75
Semester in Exam-I 120
In Semester Max Marks 50 25 25
Summative Weightage 17.5 8.75 8.75
Evaluation Semester in Exam-II Max Marks 50
120
25 25
Total= 35
%

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in

class rooms and laboratories, to appear in scheduled tests and examinations and
fulfill all other tasks assigned to him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible
for appearing in Semester end examination of the course, for cases of medical issues
and other unavoidable circumstances the students will be condoned if their
attendance is between 75% to 85% in every course, subjected to
submission of medical certificates, medical case file and other needful
documental proof to the concerned departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-
Semester Examinations to be eligible for appearing to the Semester End
Examination, failing to fulfill these conditions will deem such
student to have been detained in that course.

PLAGIARISM POLICY :
Supplement course handout, which may perhaps include special lectures and
discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and
discussions

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or
material(s) as prescribed by the Course Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.
All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

()

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE-Honors
HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]
6. References of books, Sites, Links

Text Books :

T1. John E. Hopcroft, Rajeev Motwani, and Jeffery D. Ullman, “Introduction to Automata
Theory, Languages and Computation”, 3rd Edition, Pearson Education, 2008.

T2. Linz, Peter, “An Introduction to Formal Languages and Automata”, Sixth Edition—
2016,Jones and Bartlett.

Reference Books :
R1. Sipser J Michael, “Introduction to Theory of Computation”, Third Edition—2015, Cengage.
R2. Martin Jhon, “Introduction to Languages and Theory of Computation”, Third Edition—2016,
PHI.

Web Links :
1. Theory Of Computation and Automata Tutorials: https://www.geeksforgeeks.org/theory-of-
computation-automata-tutorials/
2. Automata Tutorial: https://www.javatpoint.com/automata-tutorial
3. Automata Theory Tutorial: https://www.tutorialspoint.com/automata_theory/index.htm
4. Automata Tutorial: https://www.tutorialandexample.com/automata-tutorial

7. Keywords

NFA, DFA, Pushdown Automata, Pumping Lemma, Grammar, CFG, Turing Machine, Chomsky
Hierarchy, Derivation Keys.