- Introduction to Theory of Computation
- Finite State Machine –Prerequisites
- Finite State Machine

- Deterministic Finite Automata (DFA)
- Regular Languages
- Non-Deterministic Finite Automata (NFA)
- Conversion of NFA to DFA
- Minimization of DFA
- Minimization of DFA using Myhill Nerode Theorem

- Introduction to Mealy Machine and Moore Machine
- Construction of Mealy Machine
- Construction of Moore Machine
- Conversion of Moore Machine to Mealy Machine
- Conversion of Mealy Machine to Moore Machine

- Introduction to Epsilon NFA
- Conversion of Epsilon NFA to NFA

- Introduction to Regular Expression
- Identities of Regular Expressions
- Arden’s Theorem and Examples using Identities
- Conversion of Regular Expression to Finite Automata
- Equivalence of two Finite Automata
- Pumping Lemma for Regular Languages
- Regular Grammar

- Introduction to Context Free Language (CFL)
- Derivation Tree
- Ambiguous Grammar
- Simplification/ Reduction of CFG
- Chomsky Normal Form (CNF)
- Conversion of CFG to CNF
- Greibach Normal Form (GNF)
- Conversion of CFG to GNF
- Pumping Lemma for CFG

## SOCIAL