UNIT I : 

Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers. 

Finite Automata : NFA with Ã? transitions - Significance, acceptance of languages. Conversions and Equivalence : Equivalence between NFA with and without Ã? transitions, NFA to DFA conversion, minimisation of FSM, equivalence between two FSMâ??s, Finite Automata with output- Moore and Melay machines. 

UNIT II : 

Regular Languages : Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure properties of regular sets (proofs not required). 

Grammar Formalism : Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees, sentential forms. Right most and leftmost derivation of strings. 

UNIT III : 

Context Free Grammars : Ambiguity in context free grammars. Minimisation of Context Free Grammars. Chomsky normal form, Greiback normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted). 

Push Down Automata : Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA. 

UNIT IV : 

Turing Machine : Turing Machine, definition, model, design of TM, Computable functions, recursively enumerable languages. Churchâ??s hypothesis, counter machine, types of Turing machines (proofs not required). linear bounded automata and context sensitive language.

UNIT V :  

Computability Theory : Chomsky hierarchy of languages, linear bounded automata and context sensitive language, LR(0) grammar, decidability of, problems, Universal Turing Machine, undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NP hard problems.