ATFL

10/12/2023, 07:47 about:blank
K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2023-2024, Even Sem
Course Title :AUTOMATA THEORY AND FORMAL LANGUAGES
Course Code :22CS2002R
L-T-P-S Structure : 2-1-0-0
Pre-requisite :
Credits :3
Course Coordinator :surya kiran chebrolu
Team of Instructors :
Teaching Associates :
Syllabus :Finite Automata and Regular Languages: DFA, NFA and equivalence, Regular Expression,
Equivalence of Regular expression with FA, Arden's Theorem, Minimization of DFA. Myhill- Nerode
Theorem, Closure properties of Regular Languages. Mealy Moore Machines and conversion, Myhill-
Nerode theorem to prove languages are not regular. Pumping Lemma and its use to prove non regularity of
language, Introduction to Grammar, Regular Grammar. Context Free Grammar: CFG, Derivation, Parse
Trees, Ambiguity, Simplification of CFG: Eliminating useless symbols, Unit Productions, epsilon
production, Chomsky Normal Form and Greibach Normal Form, Pushdown Automata: Definition,
Instantaneous Description of PDA, Notion of Acceptance for PDA: by final states and by empty stack,
CFG-PDA equivalence, Pumping Lemma for CFL and closure properties of CFL, Linear bounded automata.
Turing Machines: Turing machine model, techniques for Turing machine construction, Turing machines as
language acceptors, Properties of Recursive and Recursive Enumerable Languages, combining Turing
machines, Chomsky Hierarchy and Halting Problem.
Text Books : 1:Introduction to Automata Theory, Languages and Computation,Hopcroft, Ullman,
ThirdEdition 2008,Pearson Education. 2:An Introduction to Formal Languages and Automata,Linz,
Peter,Sixth Edition—2016,Jones and Bartlett. 3:Introduction to Theory of Computation,Sipser J
Michael,Third Edition—2015,Cengage. 4:Introduction to Languages and Theory of Computation, Martin
Jhon, Third Edition—2016,PHI. 5:Theory of Computer Science: Automata Languages and Computation,KL
P Mishra and Chandrasekharan,Third Edition-2008,PHI. 6:Auotmata and Computability,Dexter C
Kozen,Second Edition-2002,Springer.
Reference Books : 1:MIT Open Courseware, Theory of Computation, Prof. Michael Sipser. 2:Oxford
Courseware, Models of Computation, Christian Coester. 3:IIT Kharagpur, Theory of Computation, Somindu
Chaya Ramanna, Dr. Sudeshna Kolay. 4:Stanford Online, Automata Theory, Jeff Ullman. 5:University of
Texas, Automata Theory, Dr. Kevin Hamlen.
Web Links :1. Theory of Automata and formal Languages, https://nptel.ac.in/courses/106103070 2.
Introduction To Automata, Languages And Computation, https://nptel.ac.in/courses/106105196 3. "Formal
Languages and Automata Theory, Dr. Diganta Goswami, Dr. K.V. Krishna" ,
https://nptel.ac.in/courses/111103016 4. Theory of Automata, Formal Languages and Computation,
https://nptel.ac.in/courses/106106049 5. Theory of Computation, https://nptel.ac.in/courses/106104148 6.
Theory of Computation, https://nptel.ac.in/courses/106106242
Course Rationale :One of the foundational courses in a computer science major is Automata Theory and
Formal Languages. It serves as the foundation for logic design and development, problem-solving, and
compiler design.
Course Objectives :The goal of this course is to determine whether or not the given problem can be solved.
If it's solvable, identify a machine that should be able to do it.
COURSE OUTCOMES (COs):
about:blank 1/24
10/12/2023, 07:47 about:blank
Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Design finite machines, regular expressions and regulargrammar
CO1 for regular languages and to prove existence of non-regular PO1,PO2,PO3 3
languages.
Design Context Free Grammars for Context Free Languages
CO2 PO1,PO2,PO3 4
andsimplify them for optimisation.
Design Push Down Automata for CFL and to prove existence of
CO3 PO1,PO2,PO3 4
non-Context Free languages
Design Turing machines, proving the existence of Non-Turing
CO4 PO3,PO1,PO2 4
acceptable languages and Chomsky Hierarchy.
COURSE OUTCOME INDICATORS (COIs)::
Outcome Highest
COI-2 COI-3 COI-4
No. BTL
Btl-3
" Apply the basic concepts
of DFA, NFA, Regular
Expressions and its
Btl-2
equivalence. Demonstrate
Define the set-theoretical
CO1 3 finite automata -Acceptors
concepts and Language
and Transducers and Apply
fundamentals
minimisation techniques for
DFA. Apply Pumping
lemma for proving Non-
regular languages
Btl-4
Btl-2 Examine simplification
Design Context-free Btl-3 techniques on CFG, Analyse
CO2 4 grammars for CFL and Apply the derivations to the CFG and convert to
simplify them for find ambiguity in CFG corresponding Normal
optimisation Forms(CNF/GNF) for
optimisation
Btl-4
Btl-2 Evaluate NPDA for CFL and
Btl-3
Explain the concepts of the procedure for NPDA-
CO3 4 Apply the derivations to
PDA design for computing CFL equivalence, Analyse
find ambiguity in CFG
functions the given language using
pumping lemma for CFL
Btl-4
Investigate the concepts of
Btl-2 Btl-3
Turing Machine construction
Explain the concepts of Demonstrate the concepts of
CO4 4 for computing
Turing Machine design for Turing Machines and its
functions.Compare different
computing functions basic operations
Formal Languages based on
Chomsky Hierarchy.
PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)
Po
Program Outcome
No.
about:blank 2/24
10/12/2023, 07:47 about:blank
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 analyse 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
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 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 and
PO11 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 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 Methods
No]
Introduction to the
Theory of Automata and
Formal Languages,
COI- Mathematical End Semester
1 CO1 [1] 5-10 Chalk,LTC,PPT,Talk
2 Preliminaries and Exam,SEM-EXAM1
fundamentals of
Languages - Symbols
and Notations
2 CO1 COI- Design of Deterministic [1] 12-21 Chalk,LTC,PPT,Talk End Semester

3 Finite Accepter (DFA) Exam,SEM-EXAM1
about:blank 3/24
10/12/2023, 07:47 about:blank
Book
No][Page Methods
No]
for acceptance of
Regular Languages
Design of Non
Deterministic Finite End Semester
COI- Automata (NFA) for Exam,Home
3 acceptance of Regular Assignment,SEM-
Languages, NFA-DFA EXAM1
equivalence
ALM,End Semester
COI- DFA minimization using Exam,Home
3 Myhill-Nerode Theorem Assignment,SEM-
EXAM1
Regular Expressions and

Representation of
Regular Languages, ALM,End Semester
COI- Conversion of RE to Exam,Home
3 NFA and then to DFA Assignment,SEM-
using Thomson's EXAM1
construction method,
Conversion of FA to RE
Introduction to Grammar
ALM,End Semester
and Generation of
COI- Exam,Home
6 CO1 Regular Languages [1] 49-55 Chalk,LTC,PPT,Talk
3 Assignment,SEM-
through Regular
EXAM1
Grammar,
Pumping Lemma for

End Semester
Regular Languages to
COI- Exam,Home
7 CO1 prove non-regularity, [1] 57-60 Chalk,LTC,PPT,Talk
3 Assignment,SEM-
Differentiate it from
EXAM1
MyHill-Nerode Theorem
Context Free Grammar

ALM,End Semester
(CFG) fundamentals,
COI- Exam,Home
8 CO2 Order of Derivations [1] 62-70 Chalk,LTC,PPT,Talk
4 Assignment,SEM-
through CFG and Parse
EXAM1
Tree
Ambiguity in CFG, proof ALM,End Semester

COI- of ambiguity, and Exam,Home
4 methods to make the Assignment,SEM-
grammar unambiguous EXAM1
End Semester
Simplification of CFGs -
COI- Exam,Home
10 CO2 Removal of Null, and [1] 81-92 Chalk,LTC,PPT,Talk
4 Assignment,SEM-
Unit Productions
EXAM1
about:blank 4/24
10/12/2023, 07:47 about:blank
Book
No][Page Methods
No]
ALM,End Semester
Simplification of CFGs -
COI- Exam,Home
11 CO2 Removal of Useless [1] 94-102 Chalk,LTC,PPT,Talk
4 Assignment,SEM-
symbols
EXAM1
ALM,End Semester
CFG Normal Forms -
COI- [1] 104- Exam,Home
12 CO2 Chomsky Normal Form Chalk,LTC,PPT,Talk
4 110 Assignment,SEM-
(CNF)
EXAM1
ALM,End Semester
CFG Normal Forms -
13 CO2 Greibach Normal Form Chalk,LTC,PPT,Talk
(GNF)
EXAM1
ALM,End Semester
COI- Removal of left [1] 115- Exam,Home
14 CO2 Chalk,LTC,PPT,Talk
4 recursion 120 Assignment,SEM-
EXAM1
ALM,End Semester
COI- Design of Pushdown [1] 125- Exam,Home
4 Automata 130 Assignment,SEM-
EXAM2
End Semester
COI- Representation of PDA [1] 134- Exam,Home
4 using Flow Chart 140 Assignment,SEM-
EXAM2
ALM,End Semester
COI- Conversion of CFG to [2] 156- Exam,Home
4 PDA 161 Assignment,SEM-
EXAM2
ALM,End Semester
COI- Conversion of PDA to [2] 156- Exam,Home
4 CFG 161 Assignment,SEM-
EXAM2
Properties of Context- End Semester

COI- Free Languages, [1] 174- Exam,Home
4 Pumping Lemma for 189 Assignment,SEM-
Context-Free Languages EXAM2
Linear Bound Automata End Semester

COI- (LBA), Context Exam,Home
20 CO3 [2]145-152 Chalk,LTC,PPT,Talk
4 Sensitive language and Assignment,SEM-
its property EXAM2
about:blank 5/24
10/12/2023, 07:47 about:blank
Book
No][Page Methods
No]
ALM,End Semester
COI- Introduction to Turing [1] 184- Exam,Home
4 Machines 192 Assignment,SEM-
EXAM2
End Semester
COI- Design of Turing [1] 176- Exam,Home
4 Machine 189 Assignment,SEM-
EXAM2
ALM,End Semester
COI- Computing Functions [1] 195- Exam,Home
4 using Turing Machines 203 Assignment,SEM-
EXAM2
ALM,End Semester
Properties of Recursive
24 CO4 and Recursive Chalk,LTC,PPT,Talk
Enumerable Languages
EXAM2
End Semester
COI- Combining Turing Exam,Home
4 Machines Assignment,SEM-
EXAM2
End Semester
COI- Chomsky Hierarchy and Exam,Home
4 Halting Problem Assignment,SEM-
EXAM2
Lecture Session wise Teaching – Learning Plan
SESSION NUMBER : 1
No Session Outcomes are mapped
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
Introduction to the Theory of Automata and Formal
20 2 PPT APPLICABLE
Languages
---
--- NOT
Mathematical Preliminaries and fundamentals of
20 2 PPT APPLICABLE
Languages - Symbols and Notations
---
about:blank 6/24
10/12/2023, 07:47 about:blank
--- NOT
5 CONCLUSION 1 PPT APPLICABLE
---
SESSION NUMBER : 2
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
Define Design of Deterministic Finite Accepter (DFA)
20 3 PPT APPLICABLE
for acceptance of Regular Languages and its components
---
--- NOT
20 Solve few problems 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 3
Teaching- Active
Methods Methods
--- NOT
---
Design of Non Deterministic Finite Accepter (NFA) for Leading
20 3 PPT
acceptance of Regular Languages question
--- NOT
20 Explain NFA-DFA equivalence 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 4
Teaching- Active
Methods Methods
--- NOT
---
Quiz/Test
20 Explain DFA minimization and its importance 3 PPT
Questions
about:blank 7/24
10/12/2023, 07:47 about:blank
--- NOT
Explain the use of Myhill-Nerode Theorem for DFA
20 3 PPT APPLICABLE
minimization.
---
--- NOT
---
SESSION NUMBER : 5
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
Explain Regular Expressions and Representation of
20 3 PPT APPLICABLE
Regular Languages,
---
--- NOT
Solve Few problems Conversion of RE to NFA and then
10 3 PPT APPLICABLE
to DFA using Thomson's construction method
---
--- NOT
Explain the steps for Conversion of FA to RE using
10 3 PPT APPLICABLE
Arden's Theorem.
---
--- NOT
---
SESSION NUMBER : 6
Teaching- Active
Methods Methods
--- NOT
---
Introduction to Grammar and Generation of Regular
20 3 PPT Peer Survey
Languages through Regular Grammar,
--- NOT
20 Explain Regular grammar and CFG 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 7
Time(min) Topic BTL Teaching- Active

Learning Learning
about:blank 8/24
10/12/2023, 07:47 about:blank
Methods Methods
--- NOT
---
--- NOT
Pumping Lemma for Regular Languages to prove non-
20 3 PPT APPLICABLE
regularity,
---
--- NOT
20 Differentiate it from MyHill-Nerode Theorem 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 8
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Context Free Grammar (CFG) fundamentals, 3 PPT APPLICABLE
---
--- NOT
20 Order of Derivations through CFG and Parse Tree 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 9
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Ambiguity in CFG, proof of ambiguity. 3 PPT APPLICABLE
---
--- NOT
20 Analyze methods to make the grammar unambiguous. 4 PPT APPLICABLE
---
--- NOT
---
about:blank 9/24
10/12/2023, 07:47 about:blank
SESSION NUMBER : 10
Teaching- Active
Methods Methods
--- NOT
---
Explain Simplification of CFGs - Removal of Null, and Leading
20 3 PPT
Unit Productions question
--- NOT
Analyze the steps of removal process by solving few
20 4 PPT APPLICABLE
problems
---
--- NOT
---
SESSION NUMBER : 11
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
Explain Simplification of CFGs - Removal of Useless
20 3 PPT APPLICABLE
symbols
---
--- NOT
Analyze the steps of conversion through solving few
20 4 PPT APPLICABLE
problems
---
--- NOT
---
SESSION NUMBER : 12
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
Explain CFG Normal Forms - Chomsky Normal Form
20 3 PPT APPLICABLE
(CNF)
---
--- NOT
Analyze the steps of conversion of CFG to CNF through
20 4 PPT APPLICABLE
solving few problems
---
about:blank 10/24
10/12/2023, 07:47 about:blank
--- NOT
---
SESSION NUMBER : 13
Teaching- Active
Methods Methods
--- NOT
---
One minute
20 CFG Normal Forms - Greibach Normal Form (GNF) 3 PPT
paper
--- NOT
Analyze the steps of conversion of CFG to GNF through
20 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 14
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Explain Left recursion in grammar and its implications 3 PPT APPLICABLE
---
--- NOT
Analyze the steps for Removal of left recursion through
20 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 15
Teaching- Active
Methods Methods
--- NOT
---
20 Explain the requirement of PDA and steps to design PDA 3 PPT --- NOT
APPLICABLE
about:blank 11/24
10/12/2023, 07:47 about:blank
---
--- NOT
Analyze the steps of design of PDA through solving few
20 4 PPT APPLICABLE
problems
---
--- NOT
---
SESSION NUMBER : 16
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Explain the Representation of PDA using Flow Chart 3 PPT APPLICABLE
---
--- NOT
20 Analyze the steps through solving few problems 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 17
Teaching- Active
Methods Methods
--- NOT
---
Quiz/Test
20 Conversion of CFG to PDA 3 PPT
Questions
--- NOT
20 4 PPT APPLICABLE
problems
---
--- NOT
---
SESSION NUMBER : 18
Teaching- Active
Methods Methods
about:blank 12/24
10/12/2023, 07:47 about:blank
--- NOT
---
--- NOT
20 Conversion of PDA to CFG 3 PPT APPLICABLE
---
--- NOT
20 4 PPT APPLICABLE
problems
---
--- NOT
---
SESSION NUMBER : 19
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Explain Properties of Context- Free Languages, 3 PPT APPLICABLE
---
--- NOT
20 Analyze Pumping Lemma for Context-Free Languages 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 20
Teaching- Active
Methods Methods
--- NOT
---
Quiz/Test
20 Explain Linear Bound Automata (LBA) 3 PPT
Questions
--- NOT
20 Analyze Context Sensitive language and its property 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 21

about:blank 13/24
10/12/2023, 07:47 about:blank
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Introduction to Turing Machines 3 PPT APPLICABLE
---
--- NOT
20 Discuss Turing Machine Construction Techniques. 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 22
Teaching- Active
Methods Methods
--- NOT
5 ATTENDANCE 1 PPT APPLICABLE
---
--- NOT
20 Explain Turing Machine and its components 3 PPT APPLICABLE
---
--- NOT
20 analyze TM by designing a few machines 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 23
Teaching- Active
Methods Methods
--- NOT
---
Quiz/Test
20 Computing Functions using Turing Machines 3 PPT
Questions
--- NOT
Analyze computing functions through solving few
20 4 PPT APPLICABLE
problems
---
--- NOT
---
about:blank 14/24
10/12/2023, 07:47 about:blank
SESSION NUMBER : 24
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
Properties of Recursive and Recursive Enumerable
20 3 PPT APPLICABLE
Languages
---
--- NOT
analyze Recursive and Recursively Enumerable
20 4 PPT APPLICABLE
Language by Solving few problems
---
--- NOT
---
SESSION NUMBER : 25
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Explain Combining Turing Machines 3 PPT APPLICABLE
---
--- NOT
20 Solve few problems in class on board 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 26
Teaching- Active
Methods Methods
--- NOT
---
Quiz/Test
20 explain Chomsky Hierarchy and Halting Problem 3 PPT
Questions
--- NOT
---
about:blank 15/24
10/12/2023, 07:47 about:blank
--- NOT
---
Tutorial Course DELIVERY Plan:
List of Experiments supposed to finish in Open Lab Sessions:
Lab
session List of Experiments CO-Mapping
no
1 Finite Automata: DFA, NFA and equivalence CO1
FA and RE: RE to NFA to DFA Conversion, FA to RE conversion using

2 CO1
Arden's Theorem
3 DFA minimization using Myhill-Nerode Theorem CO1
4 Regular Grammar: CFG and Regular Language CO2
5 CFG Derivation/Parse Trees, LMD, RMD, Ambiguity CO2
6 CFG Simplification and Normal Forms: CNF, GNF CO2
7 Design of Pushdown Automata CO3
8 PDA to CFG and CFG to PDA conversion CO3
9 Linear Bound Automata (LBA) CO3
10 Designing Turing Machines CO4
11 Designing Turing Machines for Computing Functions CO4
12 Properties of Recursive and Recursive Enumerable Languages CO4
Tutorial Session wise Teaching – Learning Plan
SESSION NUMBER : 1
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Explain Finite Automata: DFA, NFA 3 PPT APPLICABLE
---
about:blank 16/24
10/12/2023, 07:47 about:blank
--- NOT
Explain DFA, NFA and equivalence by solving few
20 3 PPT APPLICABLE
examples
---
--- NOT
---
SESSION NUMBER : 2
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 FA and RE: RE to NFA to DFA Conversion, 3 PPT APPLICABLE
---
--- NOT
20 FA to RE conversion using Arden's Theorem 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 3
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 DFA minimization using Myhill-Nerode Theorem 3 PPT APPLICABLE
---
--- NOT
20 Myhill Nerode Theorem 3 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 4
Teaching- Active
Methods Methods
about:blank 17/24
10/12/2023, 07:47 about:blank
--- NOT
---
--- NOT
20 Regular Grammar: CFG and Regular Language 3 PPT APPLICABLE
---
--- NOT
---
--- NOT
---
SESSION NUMBER : 5
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 CFG Derivation/Parse Trees 3 PPT APPLICABLE
---
--- NOT
20 LMD, RMD, Ambiguity 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 6
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
CFG Simplification : Removal of Useless, null and unit
20 3 PPT APPLICABLE
productions
---
--- NOT
20 Normal Forms: CNF, GNF 4 PPT APPLICABLE
---
--- NOT
---
SESSION NUMBER : 7
about:blank 18/24
10/12/2023, 07:47 about:blank
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Design of Pushdown Automata 3 PPT APPLICABLE
---
--- NOT
---
--- NOT
5 conclusion 1 PPT APPLICABLE
---
SESSION NUMBER : 8
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 PDA to CFG and CFG to PDA conversion 3 PPT APPLICABLE
---
--- NOT
---
--- NOT
---
SESSION NUMBER : 9
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Linear Bound Automata (LBA) 3 PPT APPLICABLE
---
--- NOT
---
about:blank 19/24
10/12/2023, 07:47 about:blank
--- NOT
---
SESSION NUMBER : 10
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Designing Turing Machines 3 PPT APPLICABLE
---
--- NOT
---
--- NOT
---
SESSION NUMBER : 11
Teaching- Active
Methods Methods
--- NOT
---
--- NOT
20 Designing Turing Machines for Computing Functions 3 PPT APPLICABLE
---
--- NOT
---
--- NOT
---
SESSION NUMBER : 12
Teaching- Active
Methods Methods
--- NOT
---
about:blank 20/24
10/12/2023, 07:47 about:blank
--- NOT
Properties of Recursive and Recursive Enumerable
20 3 PPT APPLICABLE
Languages
---
--- NOT
---
--- NOT
---
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
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Mon
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Tue
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Wed
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Thu
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Fri Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
about:blank 21/24
10/12/2023, 07:47 about:blank
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/MOOCS
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, Research
S.no CO ALM References/MOOCS
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
End Semester
Summative 120
Exam
Evaluation Max Marks 100 25 25 25 25
Total= 40 %
In Semester Semester in Weightage 18 9 9
120
Summative Exam-I Max Marks 50 25 25
Evaluation Semester in Weightage 18 9 9
Total= 36 % 120
Exam-II Max Marks 50 25 25
In Semester Weightage 8 2 2 2 2
Formative ALM 40
Max Marks 40 10 10 10 10
Evaluation
Total= 24 % Tutorial Weightage 8 2 2 2 2
40
Max Marks 40 10 10 10 10
about:blank 22/24
10/12/2023, 07:47 about:blank
Home Assignment Weightage 8 2 2 2 2

40
and Textbook Max Marks 40 10 10 10 10
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
Chamber
Delivery Sections Chamber Chamber Signature of
Name of Consultation
Component of of Consultation Consultation Course
Faculty Timings for each
Faculty Faculty Day (s) Room No: faculty:
day
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
(surya kiran chebrolu)
Signature of Department Prof. Incharge Academics & Vetting Team Member
Department Of CSE-Honors
about:blank 23/24
10/12/2023, 07:47 about:blank
HEAD OF DEPARTMENT:
Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]
about:blank 24/24

ATFL

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ATFL

Uploaded by

Copyright:

Available Formats

10/12/2023, 07:47 about:blank

COURSE OUTCOMES (COs):

COURSE OUTCOME INDICATORS (COIs)::

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals,

Lecture Course DELIVERY Plan:

2 CO1 COI- Design of Deterministic [1] 12-21 Chalk,LTC,PPT,Talk End Semester

Regular Expressions and

Pumping Lemma for

Context Free Grammar

Ambiguity in CFG, proof ALM,End Semester

Properties of Context- End Semester

Linear Bound Automata End Semester

Lecture Session wise Teaching – Learning Plan

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

Time(min) Topic BTL Teaching- Active

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

Tutorial Course DELIVERY Plan:

List of Experiments supposed to finish in Open Lab Sessions:

1 Finite Automata: DFA, NFA and equivalence CO1

FA and RE: RE to NFA to DFA Conversion, FA to RE conversion using

3 DFA minimization using Myhill-Nerode Theorem CO1

4 Regular Grammar: CFG and Regular Language CO2

5 CFG Derivation/Parse Trees, LMD, RMD, Ambiguity CO2

6 CFG Simplification and Normal Forms: CNF, GNF CO2

7 Design of Pushdown Automata CO3

8 PDA to CFG and CFG to PDA conversion CO3

9 Linear Bound Automata (LBA) CO3

10 Designing Turing Machines CO4

11 Designing Turing Machines for Computing Functions CO4

12 Properties of Recursive and Recursive Enumerable Languages CO4

Tutorial Session wise Teaching – Learning Plan

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped

No Session Outcomes are mapped