Nitte Meenakshi Institute of Technology

Bangalore

COURSE BOOK

Period of the Semester : From 29 Jul 2019 To 23 Nov 2019

ISE--C

Subject with Code : THEORY OF COMPUTATION 17IS53

Time Slot
Mon : 11:55 - 12:55 Tue : 10:55 - 11:55
Wed : Thu :
Fri : 11:55 - 12:55 Sat : 08:45 - 09:45 11:55 - 12:55

Name of the Teacher : Mr Kiran B R

1 | Page
 NMIT Lesson Plan & Execution

Name of the Faculty Mr Kiran B R

ISE--C

Date of Commencement 29 Jul 2019

Last working day of Semester 23 Nov 2019

Source Material List

1 John E. Hopcroft, Rajeev Motwani, Jeffrey UllmanIntroduction to Automata
Theory, Languages and Computation, 3rdEdition, Pearson education, 2007
2 Introduction to Formal Languages, Automata Theory and Computation by
Kamala Krithivasan, Rama R, 2009
1 Raymond Greenlaw, H.JamesHooverFundamentals of the Theory of
Computation, Principles and Practice, Morgan Kaufmann, 1998.
2 John C Martin: Introduction to Languages and Automata Theory 3rdEdition,
Tata McGraw–Hill, 2007.
3 Daniel I.A. Cohen Introduction to Computer Theory, 2ndEdition, John
Wiley& Sons, 2004.
4 Thomas A. SudkampAnIntroduction to the Theory of Computer Science,
Languages and Machines, 3rd Edition, Pearson Education, 2006.

Course Outcome List

1 Describe the core concepts in automata theory.
2 Design DFA and NFA for the given regular languages.

2 | Page
3 Apply the concepts of Regular Expression, and Context Free Grammar for
the given problem.
4 Design Push down Automata and Turing Machines to solve the complex
computation problems
5 Determine the decidability and intractability of computational problems.
Subject Name THEORY OF COMPUTATION

3 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
Module 1
1 2 Aug 2019 Introduction to Finite Automata; The
central concepts of Automata theory;
Deterministic finite automata;
Nondeterministic finite automata
2 3 Aug 2019 Introduction to Finite Automata; The
central concepts of Automata theory;
Deterministic finite automata;
Nondeterministic finite automata
3 3 Aug 2019 Introduction to Finite Automata; The
central concepts of Automata theory;
Deterministic finite automata;
Nondeterministic finite automata
4 5 Aug 2019 Introduction to Finite Automata; The
central concepts of Automata theory;
Deterministic finite automata;
Nondeterministic finite automata
5 6 Aug 2019 An application of finite automata; Finite
automata with Epsilon transitions;
Regular expressions;
6 9 Aug 2019 An application of finite automata; Finite
automata with Epsilon transitions;
Regular expressions;
7 10 Aug 2019 An application of finite automata; Finite
automata with Epsilon transitions;
Regular expressions;
8 10 Aug 2019 An application of finite automata; Finite
automata with Epsilon transitions;
Regular expressions;

4 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
Module 2
9 13 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
10 16 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
11 17 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata

5 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
12 17 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
13 19 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
14 20 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata

6 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
15 23 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
16 24 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata
17 24 Aug 2019 Finite Automata and Regular
Expressions; Applications of Regular
Expressions. Regular languages;
Proving languages not to be regular
languages; Closure properties of regular
languages; Decision properties of
regular languages; Equivalence and
minimization of automata

7 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
Module 3
18 26 Aug 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
19 27 Aug 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
20 30 Aug 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
21 31 Aug 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
22 31 Aug 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;

8 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
23 3 Sep 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
24 6 Sep 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
25 7 Sep 2019 Context -free grammars; Parse trees;
Applications; Ambiguity in grammars
and Languages. Definition of the
Pushdown automata; the languages of a
PDA;
Module 4
26 9 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs
27 16 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs

9 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
28 17 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs
29 20 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs
30 21 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs
31 21 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs
32 23 Sep 2019 Equivalence of PDA's and CFG's;
Deterministic Pushdown Automata.
Normal forms for CFGs; The pumping
lemma for CFGs; Closureproperties of
CFLs

10 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
Module 5
33 24 Sep 2019 The Turing machine
34 27 Sep 2019 The Turing machine
35 30 Sep 2019 The Turing machine
36 1 Oct 2019 The Turing machine
37 4 Oct 2019 Programming techniques for Turing
Machines; Extensions to the basic
Turing Machines; A Language that is
not recursively enumerable; An
Undecidable problem that is RE; Post’s
Correspondence problem; Advanced
Topics; Regulated rewriting L systems;
Grammar Systems; New paradigms of
Computing; DNA Computing;
Membrane Computing

11 | Page
 Planned Execution
Period Source Source
Date Topic material to Date Topic material to
be referred be referred
38 5 Oct 2019 Programming techniques for Turing
Machines; Extensions to the basic
Turing Machines; A Language that is
not recursively enumerable; An
Undecidable problem that is RE; Post’s
Correspondence problem; Advanced
Topics; Regulated rewriting L systems;
Grammar Systems; New paradigms of
Computing; DNA Computing;
Membrane Computing
39 5 Oct 2019 Programming techniques for Turing
Machines; Extensions to the basic
Turing Machines; A Language that is
not recursively enumerable; An
Undecidable problem that is RE; Post’s
Correspondence problem; Advanced
Topics; Regulated rewriting L systems;
Grammar Systems; New paradigms of
Computing; DNA Computing;
Membrane Computing

12 | Page
Module # of Classes Planned Planned Effort (till # of Classes Executed
Actual Effort (till date) % Coverage
No. (till date) date) (till date)
1 5 5hrs 0min 0 0hrs 0min 0.0
2 0 0hrs 0min 0 0hrs 0min 0.0
3 0 0hrs 0min 0 0hrs 0min 0.0
4 0 0hrs 0min 0 0hrs 0min 0.0
5 0 0hrs 0min 0 0hrs 0min 0.0

Faculty in charge HOD's Signature

Signature of Principal (&remark if any)