Introduction of DFA, String Acceptability in DFA

Conversion of NDFA to DFA

Minimization of Finite Automata

Mealy Moore Machine

Regular Expression and Arden's Methods 

Conversion of NDFS to DFS

Finite Automata win Null(^) Moves

Finite Automata convert into Regular Expression using Arden's Methods

Regular Expression to Finite Automata

Equivalence of Two Finite Automata

Pumping Lemma for Regular Expression

Introduction of Context-Free Grammer

Ambiguity of grammer 

Simplification of CFG: Use less Symbol, Null production, Unit Production

Chomsky Normal Form

Greibach Normal Form

Introduction of Push-Down Automata

String Acceptability in PDA

Introduction of TM with Example

Multi Tape Turing Machine

Multi Head Turing Machine

Halting Problem and PCP

Chomsky Hierarchy with Example

Linear Bound Automata

Total recursive Function