Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE322 FORMAL LANGUAGES AND AUTOMATION 3 0 0 3 28431::Dr. Anshu Sharma
THEORY
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50 Exam Category: 13: Mid Term Exam: All MCQ – End Term Exam: MCQ +
Course Focus EMPLOYABILITY Subjective

Course Outcomes :Through this course students should be able to

CO1 :: Understand Concepts and Abstractions for Automata as a Fundamental Computational Model
CO2 :: Understand algebraic formalisms of languages such as regular expressions, context-free grammar.
CO3 :: Compare different types of Grammars and design context free grammars for formal languages
CO4 :: Analyze the properties and structure of context-free languages
CO5 :: Understand the construction of Push Down Automata, including closure properties and their relationship with parsing techniques.
CO6 :: Understand algorithms and computability through the lens of Turing machines and relationship between various computational models.

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 THEORY OF COMPUTER K.L.P. MISHRA & N. PRENTICE HALL
SCIENCE: AUTOMATA, CHANDRASEKARAN
LANGUAGES & COMPUTATION
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 AUTOMATA, COMPUTABILITY ELAINE RICH PEARSON
AND COMPLEXITY: THEORY
AND APPLICATIONS
R-2 INTRODUCTION TO AUTOMATA HOPCROFT, MOTWANI, PEARSON
THEORY, LANGUAGES, AND ULLMAN
COMPUTATION
R-3 INTRODUCTION TO THE MICHAEL SIPSER CENGAGE LEARNING
THEORY OF COMPUTATION
R-4 THEORY OF COMPUTATION: A KAVI MAHESH WILEY
PROBLEM SOLVING APPROACH

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 R-5 INTRODUCTION TO FORMAL KAMALA PEARSON
LANGUAGES, AUTOMATA KRITHIVASAN, RAMA
THEORY AND COMPUTATION R.
R-6 THEORY OF COMPUTATION RAJESH K. SHUKLA CENGAGE LEARNING
R-7 AN INTRODUCTION TO ADESH K. PANDEY S.K. KATARIA & SONS
AUTOMATA THEORY AND
FORMAL LANGUAGES.
R-8 INTRODUCTION TO THEORY OF SATINDER SINGH A.B.S.PUBLICATION, JALANDHAR
AUTOMATA, FORMAL CHAHAL, GULJEET
LANGUAGES AND KAUR CHAHAL
COMPUTATION
R-9 AN INTRODUCTIONTO FORMAL PETER LINZ JONES & BARTLETT LEARNING
LANGUAGES AND AUTOMATA
R-10 CELLULAR AUTOMATA TOMMASO TOFFOLI MIT Press
MACHINES: A NEW
ENVIRONMENT FOR MODELING
Other Reading ( OR )

Sr No Journals articles as Compulsary reading (specific articles, complete reference)

OR-1 An Introduction to formal languages and Automata, Peter Linz, Jones & Bartlett Learning, 2001 ,

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://plato.stanford.edu/entries/cellular-automata/ Relevant details covering Introduction to Cellular automata, Notions,
Results and Philosophy.
RW-2 http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk.html Ohio State University Link: Informative material on various topics

RW-3 http://www.cs.rpi.edu/academics/courses/spring06/modcomp/ Lecture Slides from Rensselaer Polytechnic Institute (RPI). * Rensselaer
is America's oldest technological research university.
RW-4 http://www.theoryofcomputations.com/ Illustrative Examples, Short Questions, Exercises, Assignments and
Question Banks on TOC.
RW-5 http://nptel.iitm.ac.in/courses/106106049 Online_Video Lectures, IIT Madras

RW-6 http://theory.csail.mit.edu/ At MIT, there is broad range of TOC topics, including algorithms,
complexity theory, cryptography, distributed computing, computational
geometry, computational biology, and quantum computing. MIT has the
largest TOC research group in the world.
Audio Visual Aids ( AV )
Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 https://www.youtube.com/watch? Online Video Lectures, IIT Madras
v=tPUWmgFw3QA&index=17&list=PL85CF9F4A047C7BF7
AV-2 http://aduni.org/courses/theory/index.php?view=cw Video Taped lectures based on undergraduate course study of Theory of
Computation at the Massachusetts Institute of Technology (MIT).

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 AV-3 http://www.cs.uiuc.edu/class/sp10/cs373/lectures/ Online Video Lectures, University of Illinois at Urbana-Champaign

Software/Equipments/Databases
Sr No (S/E/D) (only if relevant to the course) Salient Features
SW-1 dk.brics.automaton 1.11-8 This Java package contains a DFA/NFA (finite-state automata)
implementation with Unicode alphabet (UTF16) and support for the
standard regular expression operations (concatenation, union, Kleene star)
and a number of non-standard ones (intersection, complement, etc.)
SW-2 http://en.wikipedia.org/wiki/Automata-based_programming Web Link on various ways, to practically implement concepts of
TOC/Automata.
SW-3 Visual Automata Simulator 1.2.2 A tool for simulating, visualizing and transforming finite state automata
and Turing Machines.
Virtual Labs ( VL )
Sr No (VL) (only if relevant to the course) Salient Features
VL-1 http://www.virlab.virginia.edu/VL/QCA_logic.htm Virtual Lab from University of Virginia in Charlottesville, VA. Describes
how "Quantum-dot Cellular Automata" (QCA's) can be made into
MAJORITY, OR, AND, and INVERTER logic gates.
VL-2 http://www.virlab.virginia.edu/VL/QCA_cells.htm Virtual Lab from University of Virginia in Charlottesville, VA. In
computers of the future, transistors may be replaced by assemblies of
quantum dots called "Quantum-dot Cellular Automata" (QCA's).This
page describes how QCA's can store and move information.

LTP week distribution: (LTP Weeks)

Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture)

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 FINITE AUTOMATA R-2 RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Definition and Description RW-5 Lecture 2: Basic about Strings and with Power Point
of a Finite Automaton) SW-1 description of Strings Alphabets Presentation
and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 1 Lecture 1 FINITE AUTOMATA R-2 RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Deterministic and Non- RW-5 Lecture 2: Basic about Strings and with Power Point
deterministic Finite State SW-1 description of Strings Alphabets Presentation
Machines) and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines
FINITE AUTOMATA RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Basics of Strings and RW-5 Lecture 2: Basic about Strings and with Power Point
Alphabets) SW-1 description of Strings Alphabets Presentation
and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines
Lecture 2 FINITE AUTOMATA R-2 RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Definition and Description RW-5 Lecture 2: Basic about Strings and with Power Point
of a Finite Automaton) SW-1 description of Strings Alphabets Presentation
and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines
FINITE AUTOMATA R-2 RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Deterministic and Non- RW-5 Lecture 2: Basic about Strings and with Power Point
deterministic Finite State SW-1 description of Strings Alphabets Presentation
Machines) and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines
FINITE AUTOMATA RW-3 Lecture 1: Lecture#0. Students will learn Demonstration Switch Bulb
(Basics of Strings and RW-5 Lecture 2: Basic about Strings and with Power Point
Alphabets) SW-1 description of Strings Alphabets Presentation
and Alphabets and
Deterministic and
Nondeterministic Finite
State Machines
Lecture 3 FINITE AUTOMATA R-6 SW-2 Basic description of Students will learn Demonstration Thermostats
(Acceptability of a String by R-9 Transition graph and about the use of with Power Point
a Finite properties of Transition transition function in Presentation
Automaton) function finite automata
FINITE AUTOMATA T-1 SW-3 Working of finite Students will learn White board, Live Thermostats
(Transition Graph and automata to accept a whether a string is demonstration
Properties of Transition string acceptable or not using JFLAP
Functions) acceptable by finite simulator
automata

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 4 FINITE AUTOMATA(The T-1 AV-3 Relation between DFA Students will learn Numerical Thermostats
Equivalence of and NDFA about the relation Problem
Deterministic and Non- between DFA and Solving
deterministic Finite NDFA
Automata)
Lecture 5 FINITE AUTOMATA T-1 Conversion of Mealy to Students will learn White board, Switch Bulb and
(Mealy and Moore Moore and Moore to how to Demonstration Elevators
Machines) Mealy machine convert Mealy to using JFLAP
Moore and Moore to simulator
Mealy machine
FINITE AUTOMATA R-7 Basic Description of Students will learn Demonstration Switch Bulb
(Regular Languages) Regular languages about the regular with Power Point
languages Presentation
Lecture 6 FINITE AUTOMATA T-1 OR-1 Step by Step procedure Students will learn to White board, Switch Bulb
(Minimization of Finite R-5 to construct minimum reduce Numerical
Automata) automaton a Complex Finite Problem
Automata Solving
Week 3 Lecture 7 REGULAR EXPRESSIONS T-1 RW-3 Representation of Students will learn Demonstration Compiler
AND REGULAR SETS regular expression the with Power Point
(Regular Expressions and relation between Presentation
Identities Finite Automata and
for Regular Expressions) Regular Expression
REGULAR EXPRESSIONS T-1 RW-3 Basics of Regular Students will become White board, Finding Patterns
AND REGULAR SETS R-1 expressions familiar about the Demonstration in text
(Finite Automata and R-4 regular expression with Power Point
Regular Expressions: Presentation
Transition System
Containing null moves)
Lecture 8 REGULAR T-1 Recognition of Regular Students will learn White board, Finding patterns
EXPRESSIONS AND expression by NDFA the Demonstration in text
REGULAR SETS relation between using JFLAP
(Conversion of Non-deterministic simulator
Non-deterministic Systems Finite Automata and
to Deterministic Systems) Regular Expressions
REGULAR EXPRESSIONS T-1 Extension of Arden's Students will learn to Numerical Finding patterns
AND REGULAR SETS Theorem find the regular Problem in text
(Algebraic Methods using expression Solving
Arden's Theorem) recognized by a
transition system
REGULAR EXPRESSIONS T-1 RW-4 Construction of Students will learn White board, Finding patterns
AND REGULAR SETS Deterministic system the Demonstration in text
(Non-deterministic Finite equivalent to relations between with Power Point
Automata with Null Moves nondeterministic system deterministic and Presentation
and Regular Expressions) non-deterministic
system

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 3 Lecture 9 REGULAR EXPRESSIONS T-1 Description of various Students will learn Demonstration Finding patterns
AND REGULAR SETS properties of regular set that with Power Point in text
(Equivalence of Two Finite class of regular set is Presentation,Nume
Automata and Two Regular closed under rical Problem
Expressions) union,concatenation Solving
and closure
REGULAR EXPRESSIONS T-1 Description of various Students will learn Demonstration Finding patterns
AND REGULAR SETS properties of regular set that with Power Point in text
(Closure Properties of class of regular set is Presentation,Nume
Regular Sets) closed under rical Problem
union,concatenation Solving
and closure
REGULAR EXPRESSIONS T-1 Relation of Regular Students will Demonstration Finding patterns
AND REGULAR SETS Expression and Finite undersatnd with JFLAP in text
(Equivalence between Automata the concept of simulator
regular languages: equivalence between
Construction of Finite regular expression
Automata Equivalent to a and finite automata
Regular Expression)
Week 4 Lecture 10 Test 1
Lecture 11 REGULAR EXPRESSIONS T-1 Conditions for a string Students will be able Demonstration Finding patterns
AND REGULAR SETS R-2 to belong to regular sets to test whether string using JFLAP in text
(Pumping Lemma for and application of belong to regular set simulator
Regular Sets and its Pumping lemma or not
Application)
Lecture 12 REGULAR EXPRESSIONS T-1 Subset method Students will learn White board, Finding patterns
AND REGULAR SETS the Demonstration in text
(Construction of Finite use of subset method using JFLAP
Automata Equivalent to a simulator
Regular
Expression)
REGULAR EXPRESSIONS T-1 Various properties of Students will learn Demonstration Finding patterns
AND REGULAR SETS regular languages along the with Power Point in text
(Properties of Regular with its usage in concept of union Presentation
Languages) pumping lemma ,intersection,iteration
in regular languages
Week 5 Lecture 13 REGULAR EXPRESSIONS R-3 AV-1 Description of Myhill– Students will learn Demonstration Tree automata
AND REGULAR SETS Nerode theorem for about necessary and with Power Point
(Myhill-Nerode Theorem) regularity test of a sufficient condition Presentation
language. for a language to be
regular.

Lecture 14 FORMAL LANGUAGES T-1 Derivations and Students will learn to Demonstration Compiler
(Derivations and the languages generated by derive a language with Power Point
Language Generated by a grammar from a given Presentation and
Grammar) grammar JFLAP simulator

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 5 Lecture 14 FORMAL LANGUAGES T-1 Derivations and Students will learn to Demonstration Compiler
(Definition of a Grammar) languages generated by derive a language with Power Point
grammar from a given Presentation and
grammar JFLAP simulator
FORMAL LANGUAGES T-1 Classification of Students will learn Demonstration Compiler
(Chomsky Classification of languages about with Power Point
Languages) various types of Presentation
Formal Languages
FORMAL LANGUAGES T-1 Introduction to Students will Demonstration Compiler
(Languages and their Grammars and its understand the with Power Point
Relation) significance significance of Presentation and
grammar JFLAP simulator
Lecture 15 FORMAL LANGUAGES T-1 Use of Recursive and Students will learn Demonstration Compiler
(Recursive and Recursively R-1 Recursively Enumerable about with Power Point
Enumerable Sets) Languages in the use of recursive Presentation
undecidability. set , Regular Sets and
Description of regular Regular Grammars
sets and regular
grammar
Week 6 Lecture 16 FORMAL LANGUAGES T-1 Hierarchy of Languages Students will learn Demonstration
(Languages and Automata) about with Power Point
hierarchical Presentation
relationship of
various types of
formal
Languages and
different types of
Automata
FORMAL LANGUAGES T-1 Relation between 4 Students will learn Demonstration Elevators
(Chomsky hierarchy of types of the with Power Point
Languages) languages and automata relationship between Presentation
TM,LBA,PDA and
FA
Lecture 17 Test 2
Lecture 18 REGULAR GRAMMARS T-1 Construction of regular Students will learn White board, Compiler
(Converting Regular grammar for a given the Demonstration
Expressions to Regular regular expression relation between with Power Point
Grammars) regular grammar and Presentation
regular Expression
Week 7 Lecture 19 REGULAR GRAMMARS T-1 Construction of a Students will learn to White board, Compiler
(Converting Regular R-1 regular expression for a derive a regular Demonstration
Grammars to Regular given regular grammar expression from a with Power Point
Expressions) regular grammar Presentation
REGULAR GRAMMARS T-1 Construction of a Students will learn to White board, Compiler
(Left Linear and Right R-1 regular expression for a derive a regular Demonstration
Linear Regular given regular grammar expression from a with Power Point
Grammars) regular grammar Presentation

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 SPILL OVER
Week 7 Lecture 21 Spill Over

MID-TERM
Week 8 Lecture 22 CONTEXT- FREE T-1 Different ways of Students will learn White board,
LANGUAGES(Leftmost deriving a grammar about Demonstration
and rightmost derivations) the difference with Power Point
between left and right Presentation
derivation of
grammar
CONTEXT- FREE T-1 Introduction of context Students will learn to White board,
LANGUAGES(Language of free grammar visualize derivations Demonstration
a CFG) of Context Free with Power Point
Grammar Presentation
CONTEXT- FREE T-1 Different Types of Students will learn White board,
LANGUAGES(Derivations Derivation- Left Linear, about Demonstration
Generated by a Grammar) Right Linear, Derivation the difference with Power Point
Tree between left and right Presentation
derivation of
grammar, and
Derivation Tree
Lecture 23 CONTEXT- FREE T-1 Applications of context Students will learn Demonstration
LANGUAGES(Applications free grammar. about with Power Point
of CFG) real life examples of Presentation
Context Free An
Grammars
Lecture 24 CONTEXT- FREE T-1 Sentential forms of Students will learn Demonstration
LANGUAGES(Sentential context free grammar the importance of with Power Point
forms) sentential forms and Presentation
its derivation
CONTEXT- FREE T-1 Method to eliminate null Students will learn White board,
LANGUAGES(Elimination and unit production the Numerical
of null and unit productions) concept of reduction Problem
of grammars. Solving
Week 9 Lecture 25 CONTEXT- FREE T-1 Rules of Pumping Students will learn to Demonstration
LANGUAGES(Pumping lemma for Context free test using JFLAP
Lemma for CFG) languages and whether the language
applications of pumping is context free or not
lemma
Lecture 26 CONTEXT- FREE T-1 Procedure of finding the Students will learn to Numerical
LANGUAGES(Ambiguity ambiguity in context check whether the Problem Solving
in CFG) free grammar grammar is
ambiguous or not

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 9 Lecture 27 SIMPLIFICATION OF T-1 Different ways to reduce Students will learn Numerical
CONTEXT- FREE Context Free Grammar the Problem Solving
GRAMMARS(Construction methods to simplify
of Reduced context free grammar
Grammars)
SIMPLIFICATION OF T-1 Description of various Students learn to Numerical
CONTEXT- FREE types of normal forms reduce the Context Problem Solving
GRAMMARS(Greibach for context free free grammars into
Normal Form) grammars CNF and GNF
Week 10 Lecture 28 CONTEXT- FREE T-1 Description of various Students learn to Numerical
LANGUAGES(Normal types of normal forms reduce the Context Problem
Forms for CFG: Chomsky for context free free grammars into Solving
Normal Form) grammars CNF
Lecture 29 CONTEXT- FREE T-1 Different ways to reduce Students will learn Numerical
LANGUAGES(Construction Context Free Grammar the Problem
of Reduced Grammars) methods to simplify Solving
context free grammar
Lecture 30 PUSHDOWN AUTOMATA T-1 Description and model Students will learn Demonstration
AND PARSING of Push Down Automata the with Power Point
(Description and Model of basics of Presentation
Pushdown Automata) Push Down Automata
PUSHDOWN AUTOMATA T-1 Method to Represent Students will learn Demonstration
AND PARSING Push Down Automata the with Power Point
(Representation of PDA) basics of Presentation
Push Down Automata
Week 11 Lecture 31 PUSHDOWN AUTOMATA T-1 Types of acceptance by Students will learn Demonstration
AND PARSING push down the with Power Point
(Acceptance by PDA) automata different types of Presentation
acceptance by PDA
PUSHDOWN AUTOMATA T-1 Types of Students will learn Demonstration
AND PARSING(Pushdown Pushdown Automata the with Power Point
Automata: NDPDA and difference between Presentation
DPDA) Deterministic PDA
and
Non Deterministic
PDA
PUSHDOWN AUTOMATA T-1 Conversion of Context Students will learn Demonstration
AND PARSING(Context free grammar into Push the with Power Point
free languages and PDA) down Automata relationship between Presentation
Push Down Automata

and
Context Free
Languages

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 11 Lecture 31 PUSHDOWN AUTOMATA T-1 Types of acceptance by Students will learn to Demonstration
AND PARSING Pushdown Automata check whether a input with Power Point
(Comparison of string is acceptable Presentation
deterministic and non- by PDA or not
deterministic versions)
Lecture 32 PUSHDOWN AUTOMATA T-1 Conversion of Context Students will learn Demonstration
AND PARSING(Pushdown free grammar into Push the with Power Point
Automata and Context-Free down Automata relationship between Presentation
Languages) Push Down Automata

and
Context Free
Languages
Lecture 33 PUSHDOWN AUTOMATA R-1 Description of the Students will learn Demonstration
AND PARSING(closure closure the with Power Point
properties) properties of CNF closure Presentation
properties of CNF
Week 12 Lecture 34 PUSHDOWN AUTOMATA T-1 Basics of LL(k) in Students will learn Demonstration
AND PARSING(LL (k) Parsing and Top down , the with Power Point
Grammars and its Bottom up parsing Purpose of LL(k) in Presentation
Properties) Parsing and
difference between
Top down and
Bottom up Parsing
PUSHDOWN AUTOMATA T-1 Basics of LL(k) in Students will learn Demonstration
AND PARSING(LR(k) Parsing and Top down , the with Power Point
Grammars and its Bottom up parsing Purpose of LL(k) in Presentation
Properties) Parsing and
difference between
Top down and
Bottom up Parsing
PUSHDOWN AUTOMATA T-1 Basics of LL(k) in Students will learn Demonstration
AND PARSING(PARSING: Parsing and Top down , the with Power Point
Top-Down and Bottom-Up Bottom up parsing Purpose of LL(k) in Presentation
Parsing) Parsing and
difference between
Top down and
Bottom up Parsing
Lecture 35 TURING MACHINES AND T-1 AV-3 Various ways to Students will learn Demonstration
COMPLEXITY(Turing R-8 represent Turing the basics of Turing with Power Point
Machine Model) R-9 Machines Machines Presentation

TURING MACHINES AND T-1 AV-3 Various ways to Students will learn Demonstration
COMPLEXITY R-8 represent Turing the basics of Turing with Power Point
(Representation of Turing R-9 Machines Machines Presentation
Machines)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 35 TURING MACHINES AND T-1 AV-3 Various ways to Students will learn Demonstration
COMPLEXITY(Variations R-8 represent Turing the basics of Turing with Power Point
of TM) R-9 Machines Machines Presentation

TURING MACHINES AND T-1 AV-3 Various ways to Students will learn Demonstration
COMPLEXITY(Variations R-8 represent Turing the basics of Turing with Power Point
of Turing Machine) R-9 Machines Machines Presentation

Lecture 36 Test 3
Week 13 Lecture 37 TURING MACHINES AND T-1 Methods of Students will learn to Demonstration
COMPLEXITY(Design of R-8 designing Turing design and using JFLAP
Turing Machines) R-9 Machines construct simulator
Turing Machines
Lecture 38 TURING MACHINES AND T-1 VL-1 Description of Model of Students will learn Demonstration
COMPLEXITY(The Model VL-2 Linear Bounded the with Power Point
of Linear Bounded Automaton need of Presentation
Automaton) Model of Linear
Bounded Automaton
TURING MACHINES AND T-1 VL-1 Basics of Students will learn Demonstration
COMPLEXITY(Power of R-2 VL-2 Linear Bounded the with Power Point
LBA) Automaton importance of Linear Presentation
Bounded Automaton
TURING MACHINES AND T-1 VL-1 Description of Non Students will learn Demonstration
COMPLEXITY(Non- VL-2 Deterministic Turing the with Power Point
Deterministic Turing Machines importance of Presentation
Machines) Non
Deterministic Turing
Machines
TURING MACHINES AND T-1 VL-1 Basics of Students will learn Demonstration
COMPLEXITY(Power of R-2 VL-2 Linear Bounded the with Power Point
Linear Bounded Automaton) Automaton importance of Linear Presentation
Bounded Automaton
TURING MACHINES AND R-10 RW-1 Basics of Students will learn Demonstration
COMPLEXITY(Cellular cellular the with Power Point
automaton) Automaton importance of Presentation
cellular Automaton
Lecture 39 TURING MACHINES AND R-2 RW-6 Description of Halting Students will learn Demonstration
COMPLEXITY(Halting R-3 AV-2 Problem the with Power Point
Problem of Turing Machine) R-8 reduction technique Presentation
used to prove the
undecidability in
Turing Machine
TURING MACHINES AND R-2 RW-6 Description of Students will learn Demonstration
COMPLEXITY(Post R-3 AV-2 Undecidable decision about with Power Point
Correspondence Problem) R-8 problems proofs of Presentation
undecidability

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 13 Lecture 39 TURING MACHINES AND R-2 Description of Students will learn Demonstration
COMPLEXITY R-8 recursively enumerable about recursively with Power Point
(RECURSIVELY language enumerable language Presentation
ENUMERABLE
LANGUAGE)
Week 14 Lecture 40 TURING MACHINES AND R-5 RW-2 Basics of Students will learn Demonstration
COMPLEXITY(Basic R-9 SW-1 Computability the use of with Power Point
Concepts of Computability) computability Presentation
TURING MACHINES AND R-5 RW-2 Description of Students will learn Demonstration
COMPLEXITY(Decidable R-9 SW-1 Decidable and the with Power Point
and Undecidable languages) Undecidable languages difference between Presentation
Decidable and
Undecidable
languages
TURING MACHINES AND R-5 RW-2 Types of Complexity Students will learn Demonstration
COMPLEXITY R-9 SW-1 about with Power Point
(Computational Complexity: variants Presentation
Measuring Time & Space of Complexity
Complexity)

SPILL OVER
Week 14 Lecture 42 Spill Over
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over

Scheme for CA:

CA Category of this Course Code is:A0203 (2 best out of 3)

Component Weightage (%) Mapped CO(s)

Test 1 50 CO1, CO2
Test 2 50 CO3
Test 3 50 CO4, CO5, CO6

Details of Academic Task(s)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Test 1 To test the Test 1 will be Multiple-choice questions based on the Content Individual Offline 30 3/4
understanding level covered till lecture 9
of the students for
topics covered as
mentioned in detail
Test 2 To test the Test 2 will be Multiple-choice questions based on the Content Individual Offline 30 5/6
understanding level covered till lecture 16
of the students for
topics covered as
mentioned in detail
Test 3 To test the Test 3 will be Multiple-choice questions based on the Content Individual Offline 30 11 / 12
understanding level covered till lecture 35
of the students for
topics covered as
mentioned in detail
MOOCs/ Certification etc. mapped with the Academic Task(s)
Academic Task Name Of Certification/Online Course/Test/Competition mapped Type Offered By Organisation
Test 1 THEORY OF COMPUTATION MOOCs NPTEL
Test 2 THEORY OF COMPUTATION MOOCs NPTEL
Test 3 THEORY OF COMPUTATION MOOCs NPTEL

Where MOOCs/ Certification etc. are mapped with Academic Tasks:

1. Students have choice to appear for Academic Task or MOOCs etc.
2. The student may appear for both, In this case best obtained marks will be considered.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.