Theory of Computation

UNIT 1: Automata

 Basic machine
 Finite State Machine
 Transition graphs
 Transition matrix
 Deterministic and nondeterministic FSM’S
 Equivalence of DFA and NDFA
 Mealy and Moore Machines
 minimization of finite automation
 Two-way finite automata
 Regular Sets
 Regular Expressions
 Myhill- Nerode theorem Pumping lemma and regular sets
 Application of pumping lemma
 Closure properties

UNIT 2: Context –Free Grammars

 Context-free grammar
 Regular Grammar
 Derivation trees and Ambiguity
 Simplification of CFG

UNIT 3: Pushdown Automata

 Definition of PDA
 Deterministic Finite Automata
 Converting a CFG to a PDA
 Converting a PDA to a CFG
 The pumping lemma for CFL’s

UNIT 4: Turing Machines

 Introduction of Turing Machines
 Recursive and Recursively Enumerable Languages
 Universal Turing Machines

UNIT 5: Tractable and Untractable Problems

 P, NP, NP complete and NP hard problems
 Hamiltonian path problem, traveling sales man problem
 vertex cover problem