COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

Dept.: COMPUTER SCIENCE & ENGINEERING

: SATENDRA KUMAR :
Name/Dept. Year/Semester 2nd / 4th

Theory of Automata and Formal Hours

Subject : : 40
Languages Required
Code BCS402 Hours Planned 88
: :
The basic understanding of discrete
Coordinator Mr. Vishal Yadav Pre-Requisite
: mathematical & Structures.

Course Objectives:

1. Understand basic properties of formal languages and formal grammars.

2. Understand basic properties of deterministic and nondeterministic finite automata
3. Understand the relation between types of languages and types of finite automata
4. Understanding the Context free languages and grammars, and also Normalizing CFG.
5. Understanding the minimization of deterministic and nondeterministic finite automata.
6. Understand basic properties of Turing machines and computing with Turing machines.
7. Understand the concept of Pushdown automata and its application.
8. Know the concepts of tractability and decidability, the concepts of NP-completeness and NP-hard problem.
9. Understand the challenges for Theoretical Computer Science and its contribution to other sciences.

Course Outcomes:
1. Analyze and design finite automata, pushdown automata, Turing machines, formal languages, and Grammars.
2. Analyze and design, Turing machines, formal languages, and grammars.
3. Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and complexity through problem solving.
4. Prove the basic results of the Theory of Computation.
5. State and explain the relevance of the Church-Turing thesis.
6. Understand the basic properties of formal languages and grammars.
7. Differentiate regular, context-free and recursively enumerable languages.
8. Make grammars to produce strings from a specific language.
9. Acquire concepts relating to the theory of computation and computational models including decidability and intractability.
Unit I
Text Books:
Basic Concepts and Automata 1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

Theory: edition, Pearson Education Asia

Target Lecture Hours :30 2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
Target Tutorial Hours : 02 4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
Sl. Period 6. Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
01 11.04.2022 1 Introduction and Syllabus discussion 5 White Board Marker
02 12.04.2022 1 Introduction to Theory of Computation 5 White Board Marker
03 13.04.2022 2 Automata, Computability and Complexity 5 White Board Marker
04 15.04.2022 2 Alphabet, Symbol, String 5 White Board Marker
05 18.04.2022 1 Formal Languages: DFA, NFA, ε NFA 5 White Board Marker
06 19.04.2022 2 Deterministic Finite Automaton (DFA) 5 White Board Marker
07 22.04.2022 1 Definition, Representation of DFA 5 White Board Marker
08 23.04.2022 2 Acceptability of a String and Language 5 White Board Marker
09 25.04.2022 3 Non Deterministic Finite Automaton (NFA) 5 White Board Marker
10 28.04.2022 1 Equivalence of DFA and NFA 5 White Board Marker
11 29.04.2022 2 NFA with ε-Transition 5 White Board Marker
Equivalence of NFA’s with and without ε- 5
12 02.05.2022 2 White Board Marker
Transition
13 02.05.2022 1 Minimization of Finite Automata 5 White Board Marker
Finite Automata with output- Moore 5
14 03.05.2022 1 White Board Marker
Machine, Mealy Machine
15 02.05.2022 2 Equivalence of Moore and Mealy Machine 5 White Board Marker
Myhill- Nerode Theorem, Simulation of DFA and 5
16 05.05.2022 2 White Board Marker
NFA
17 07.05.2022 1 Tutorials 5
18 09.05.2022 1 Class Test 5

Faculty Class Coordinator HoD

Unit II
Text Books:
Regular Expressions and 1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

Languages edition, Pearson Education Asia

Target Lecture Hours :19 2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
Target Tutorial Hours : 02 5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
6. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI, 2007.
Sl. Period Actual Date of
Date Topics to be Covered Ref. Book/ Page No. Mode of Teaching Remark
No. Reqd. Completion
1 10.05.2022 1 Regular Expressions 3 White Board Marker
2 11.05.2022 1 Transition Graph 3 White Board Marker
Kleen’s Theorem, Finite Automata and Regular 3
3 12.05.2022 1 White Board Marker
Expression
4 13.05.2022 2 Arden’s theorem, 3 White Board Marker
5 16.05.2022 1 Algebraic Method Using Arden’s Theorem 3 White Board Marker
6 17.05.2022 1 Regular and Non-Regular Languages 3 White Board Marker
7 18.05.2022 2 Closure properties of Regular Languages 3 White Board Marker
8 20.05.2022 1 Pigeonhole Principle 3 White Board Marker
9 21.05.2022 2 Pumping Lemma 3 White Board Marker
10 24.05.2022 1 Application of Pumping Lemma 3 White Board Marker
11 25.05.2022 1 Decidability- Decision properties 3 White Board Marker
12 26.05.2022 2 Finite Automata and Regular Languages 3 White Board Marker
13 27.05.2022 1 Regular Languages and Computers 3 White Board Marker
Simulation of Transition Graph and Regular 3
14 28.05.2022 2 White Board Marker
language
15 30.05.2022 1 Tutorial
16 31.05.2022 1 Class test

Faculty Class Coordinator HoD

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

Unit III
Text Books:
Regular and Non-Regular 1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd
Grammars edition, Pearson Education Asia
2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
Target Lecture Hours : 14 3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
Target Tutorial Hours : 02 6. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI,
2007.
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion

01 01.06.2022 2 Context Free Grammar(CFG)-Definition 6 White Board Marker

02 03.06.2022 1 Derivations Tree 6 White Board Marker
03 04.06.2022 1 Languages 6 White Board Marker
04 06.06.2022 1 Derivation Trees 6 White Board Marker
05 07.06.2022 1 Ambiguity 6 White Board Marker
Regular Grammars-Right Linear and Left 6
06 08.06.2022 1 Linear grammars
White Board Marker

07 09.06.2022 1 Conversion of FA into CFG 6 White Board Marker

08 10.06.2022 1 Conversion Regular grammar into FA 6 White Board Marker
09 11.06.2022 1 Simplification of CFG 6 White Board Marker
10 13.06.2022 1 Normal Forms- Chomsky Normal Form(CNF) 6 White Board Marker
11 14.06.2022 1 Greibach Normal Form (GNF), 6 White Board Marker
12 15.06.2022 1 Chomsky Hierarchy 6 White Board Marker
Programming problems based on the properties 6
13 17.06.2022 1 of CFGs
White Board Marker

14 18.06.2022 1 Tutorial 6
15 20.06.2022 1 Class test 6
Faculty Class Coordinator HoD
Unit IV
Text Books:

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd
Push Down Automata and edition, Pearson Education Asia
Properties of Context Free 2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
Languages
3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
Target Lecture Hours :13 4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
Target Tutorial Hours : 02
5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.

Sl. Period Ref. Book/ Page Actual Date of

Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
01 21.06.2022 1 Nondeterministic Pushdown Automata (NPDA) 1 White Board Marker
02 22.06.2022 1 NPDA Definition, Moves 1 White Board Marker
03 23.06.2022 2 A Language Accepted by NPDA 1 White Board Marker
04 25.06.2022 1 Deterministic Pushdown Automata(DPDA) 1 White Board Marker
05 27.06.2022 2 Deterministic Context free Languages(DCFL) 1 White Board Marker
Pushdown Automata for Context Free 1
06 29.06.2022 1 White Board Marker
Languages
Context Free grammars for Pushdown 1
07 30.06.2022 1 White Board Marker
Automata
08 01.07.2022 1 Two stack Pushdown Automata, 1 White Board Marker

09 02.07.2022 1 Pumping Lemma for CFL 1 White Board Marker

10 04.07.2022 1 Closure properties of CFL 1 White Board Marker

11 05.07.2022 1 Decision Problems of CFL 1 White Board Marker
Programming problems based on the 1
12 06.07.2022 1 White Board Marker
properties of CFLs
13 07.07.2022 1 Tutorial 1 White Board Marker
14 08.07.2022 1 Class test 1 White Board Marker

Faculty Class Coordinator HoD

Unit V
Text Books:

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

Turing Machines and 1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd
Recursive Function Theory edition, Pearson Education Asia
2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
Target Lecture Hours :12
3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
Target Tutorial Hours : 02 5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
6. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI, 2007.
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
Turing Machines and Recursive Function
01 09.07.2022 1 White Board Marker
Theory
02 11.07.2022 1 Basic Turing Machine Model White Board Marker
03 12.07.2022 1 Representation of Turing Machines White Board Marker
04 13.07.2022 1 Language Acceptability of Turing Machines White Board Marker
Techniques for Turing Machine
05 14.07.2022 1 Construction Modifications of Turing White Board Marker
Machine
Turing Machine as Computer of Integer
06 15.07.2022 1 White Board Marker
Functions
Universal Turing machine, Linear Bounded
07 16.07.2022 1 White Board Marker
Automata
08 16.07.2022 1 Church’s Thesis White Board Marker
Recursive and Recursively Enumerable
language, Halting Problem, Post’s
09 17.07.2022 1 White Board Marker
Correspondence
Problem
10 18.07.2022 1 Introduction to Recursive Function Theory White Board Marker
11 18.07.2022 1 Tutorial White Board Marker
12 18.07.2022 1 Class test

Faculty Class Coordinator HoD

Text Books:

Theory of Automata & Formal Language Satendra Kumar (A.P.)

 COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)

1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2 nd edition, Pearson Education
Asia
2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
3. Elements and Theory of Computation, C Papdimitrou and C. L. Lewis, PHI
4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
6. K.L.P. Mishra: Theory of Computer Science, Automata, Languages, and Computation, 3rd Edition, PHI, 2007.

Reference Books:
1. Theory of Computation, By K.V.N. Sunitha and N.Kalyani
2. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation, Principles and Practice, Morgan Kaufmann, 1998.
3. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
4. Introduction to languages and the Theory of Computation ,John C Martin, TMH
5. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson /PHI.
6. Theory of Computer Science and Automata languages and computation -Mishra and Chandrashekaran, 2nd edition, PHI.
7. Theory of Computation, By Peter Linz.

Faculty In-charge Class Coordinator HoD

PRINCIPAL

Theory of Automata & Formal Language Satendra Kumar (A.P.)