AMRUTVAHINI COLLEGE OF ENGINEERING, SANGAMNER
Subject:
DEPARTMENT OF COMPUTER ENGINEERING
TEACHING PLAN, 2014-2015
THEORY OF COMPUTATION
Code : 310241
Class:
T.E.Computer Engineering
Lectu
re No.
Theory : 04 hrs / week
Date
Status
Topics to be covered
1. 16/06/2014 Introduction
Unit I: Basic Concepts and Formal Language theory:
2. 18/06/2014 Languages in abstract, Defining languages,Klenneclosure,Symbol
/alphabets,string/word,
Formal
Introduction
3. 20/06/2014 Introduction,mathematical foundation. Mathematical
Formal Language Theory Representation for Formal
lang.
4. 20/06/2014 Sets, Logic, Functions, Relations, Graphs,Proof
Techniques-Formal Proofs, Inductive Proofs, Strings
& Languages,ex.,Basic-Machine:Functionality-and
limit.
5. 23/06/2014 Importance of Automata Theory. Automata,
Automata- Formal Def.&Designing Finite Automata
examples, Simplified Notation, NondeterminismFormal Definition & Designing Nondeterministic
Finite Automata, Computability & Complexity,
Pattern Matching
6. 24/06/2014 Language Acceptor: Concept, Machine as a
language acceptor, example, Machine as a string
processor. Finite Automata- Formal Definition
&
Designing Finite Automata –basic examples,
Simplified Notation.
7. 25/06/2014 Regular Expressions and Languages:Recursive
definition of regular expression, regular set,
identities
of
regular
expressions,
regular
expressions, ex. and FA. Need of RL
8. 27/06/2014 Equivalence of RE.ex.Identity Rules&Algebraic laws
for R.E.
9. 30/06/2014 RL
and
examples.
Pumping
lemma
for
RL.Limitations of R.E.
10. 01/07/2014 Application and properties of Finite Automata.
Unit II: Deterministic and Non deterministic Finite Automata
11. 02/07/2014 DFA: Definition and description of DFA, Transition
Function of a DFA, NFA: Definition and description
of DFA, Transition Function of a NFA, Є-NFA:
12. 04/07/2014 Definition and description of NFA,Transition
Function of a NFA, Language acceptance by a
FA(NFA , DFA) and string acceptance, Conversion
of NFA withЄ to NFA without Є,
13. 07/07/2014 Conversion of NFA without Є to DFA, Conversion
of NFA with Є to DFA (direct method and subset
construction method), Minimization of a DFA.
14. 08/07/2014 Inter-conversion RE and FA: Construction of FA
equivalent to RE using state loop elimination
method.
Cumulative
% Syllabus
Coverage
Justific
ation
[Complet
[If Not
ed/Not
Comple
Complete
ted]
d]
18%
36%
ACAD-R-05, Rev.: 01 Date: 17-06-2013
AMRUTVAHINI COLLEGE OF ENGINEERING, SANGAMNER
Subject:
DEPARTMENT OF COMPUTER ENGINEERING
TEACHING PLAN, 2014-2015
THEORY OF COMPUTATION
Code : 310241
Class:
T.E.Computer Engineering
15. 09/07/2014
16. 11/07/2014
17. 14/07/2014
18. 15/07/2014
Unit III: Grammar
19. 16/07/2014
Theory : 04 hrs / week
Construction of FA equivalent to RE using
Andrsen’s Theorem. Construction of RE equivalent
to FA(RE to Є-NFA, Є-NFA to DFA. FA with output
Moore
and
Mealy
machines,Definition,
models,interconver
Pumping Lemma for RL, Properties of RL and FA:
Closure and Decision properties, Limitations of FA.
Grammar- Definition, representation of grammar,
Chomsky hierarchy,CFG-Definition,
Derivation,
sentential form, parse tree, inference, derivation,
parse tree
20. 18/07/2014 ambiguity in grammar and language- ambiguous
Grammar and Push Down grammar, removing
ambiguity from grammar, Normal Forms- Chomsky
normal form
21. 21/07/2014 GNF, Closure properties of CFL, Decision property
of CFL. Automata Regular grammar- Definition left
linear, right linear grammar, FA to RG and RG to
FA, Application of grammar.
22. 22/07/2014 ambiguous grammar. Recursive, Recursively
Enumerable Languages:
23. 23/07/2014 A Language that is not recursively enumerable, An
Undecidable Problem that is RE Recursive
Languages
24. 25/07/2014 TheUniversal language. Introduction to concurrent
grammar. Concurrent Grammar,Formal-methods in
concurrency,
25. 28/07/2014 Graph Grammar,Aspect of Concurrency in Graph
Grammar,
26. 30/07/2014 set theoretic approaches to Graph Grammar, Graph
Grammar for parallel computation, Decision
Problem for CFL.
Unit - IV Turing machines
27. 01/08/2014 Turing machines (TMs): TM Model and
conventions,Formal Definition,TM Instantaneous
Description (ID),Transition Fun.
28. 04/08/2014 Languages of TM, Equivalence of final state and
halting state (TM and halting), TM and Computers:
Simulating a TM by computer, Simulating a
computer by TM
29. 05/08/2014 Types of TM: Deterministic Turing Machines (DTM)
and Non-deterministic Turing Machines (NTM)
30. 06/08/2014 Extension to Basic TM: TM with Multiple tracks,
Multitape TMs,
31. 08/08/2014 Universal TM (UTM), Church-Turing hypothesis ,
Post Machines: Introduction to Post Machines
(PMs),
32. 11/08/2014 Comparison between FA, PDA, PM TM
33. 12/08/2014 Concurrency and parallel machines considerations
while designing TuringM/c.
34. 13/08/2014 Examples of Concurrent Turing Machines. problem
in TM: Undecidable problems about Turing
Machines, Reduction
52%
70%
ACAD-R-05, Rev.: 01 Date: 17-06-2013
AMRUTVAHINI COLLEGE OF ENGINEERING, SANGAMNER
Subject:
DEPARTMENT OF COMPUTER ENGINEERING
TEACHING PLAN, 2014-2015
THEORY OF COMPUTATION
Code : 310241
Class:
T.E.Computer Engineering
35. 19/08/2014
Post Correspondence Problem(PCP, NPCP)
36. 20/08/2014
Definition Modified PCP, Other Undecidable
Problems, Non-deterministic Turing Machine,
Language Accepted by turing machine and type
0 languages
Unit V : Push Down Automata
37. 22/08/2014 Defination , Notation, acceptance by final state&
empty stack,equi-PDA
38. 25/08/2014 CFG- Grammar to PDA, PDA to
Grammar,DPDA,NPDA
39. 26/08/2014 Parsing and PDA. Application of PDA.
40. 27/08/2014 (NPDA).Introduction to Post Machines (PMs),
Unit VI: Tractable & Intractable
41. 01/09/2014 Classes P and NP:Problems Solvable in P
Time,Example of Kruskal algorithm
42. 02/09/2014 ND Polynomial Time, An NP ex. Travaveling-sales
problem.
43. 03/09/2014 Polynomial-Time Reductions NPCompleteProblems.
44. 05/09/2014 An NP-Complete Problem: The Satisfiability
Problem,
45. 08/09/2014 Tractable and Intractable Representing SAT
Instances,
46. 09/09/2014 NP-Completeness of the SAT Problem,A Restricted
sat.problem
47. 10/09/2014 Normal Forms for Boolean Expressions, Converting
Expressions to CNF,.The Problem of Independent
Sets
48. 12/09/2014 Node-Cover, Directed- Undirected Hamilton-Circuit
Problem. Halting Problem
Prof. S.K.Sonkar
Staff In-Charge
Theory : 04 hrs / week
84%
100%
Prof. R. L. Paikrao
Head of the Department
ACAD-R-05, Rev.: 01 Date: 17-06-2013