Note for FORMAL LANGUAGES AND AUTOMATA THEORY - FLAT By Jasaswi Prasad Mohanty

Mathematical preliminaries: Alphabet, String, Languages, Grammars, Strings and operations on strings. Finite Automata: Definition, Basic model, Types of Finite Automata, NFA vs. DFA, NFA to DFA conversion, Eliminating ε-transitions from NFA, NFA as a language acceptor, Minimization of Finite Automata, Design of DFA

Regular Expressions: Operators in Regular expressions, Building Finite Automata from Regular expression, Arden’s theorem, Building Regular expression from Finite Automata, Pumping Lemma for Regular languages, Closure properties of Regular languages.CYK algorithm.

Context-Free Grammars And Lanquages

Derivation Of Strings

Context Free Grammar And Normal Form

Testing Membership in a CFL

Push Down Automata

Turing Machine

Computable Functions