Formal Language & Automata Theory (PCC-CS403)
6 units: Introduction, Regular languages and finite automata, Context-free languages and pushdown automata, Context-sensitive languages, Turing machines · L-T-P 3L/week.
Detailed syllabus
Unit 1: Introduction (6 hours)
Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of languages.
Unit 2: Regular languages and finite automata (7 hours)
Regular languages and finite automata: Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and equivalence with finite automata, properties of regular languages, pumping lemma for regular languages, minimization of finite automata)
Unit 3: Context-free languages and pushdown automata (6 hours)
Context-free languages and pushdown automata: Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for context-free languages, deterministic push down automata, closure properties of CFLs.
Unit 4: Context-sensitive languages (6 hours)
Context-sensitive languages: Context-sensitive grammars (CSG) and languages, linear bounded automata and equivalence with CSG.
Unit 5: Turing machines (6 hours)
Turing machines: The basic model for Turing machines (TM), Turing recognizable(recursively enumerable) and Turing-decidable (recursive) languages and their closure properties, variants of Turing machines, nondeterministic TMs and equivalence with deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMsas enumerators
Unit 6: Undecidability (6 hours)
Undecidability: Church-Turing thesis, universal Turing machine, the universal and diagonalization languages, reduction between languages and Rice s theorem, undecidable problems about languages
Source: official document