- Duration: 60+
- Start Date: 07 Jan, 2025
- No. Of. Projects: 0
- Certification Provided: No
Course Overview
Automata are widely used for modelling and verification of software, distributed systems, real-time systems, or structured data. They have been equipped with features to model time and probabilities as well.
Course Curriculum
-
Topic:01Languages: Alphabets and Strings. Regular Languages: Regular Expressions, Regular Languages, Regular Grammars, RL and LL grammars, Closure properties
-
Topic:01Finite Automata: FA as language acceptor or verifier, NFA ( with and without ε) , DFA, RE to NFA, NFA to DFA, Reduced DFA , NFA-DFA equivalence, FA to RE. Finite State Machines with output : Moore and Mealy machines. Moore and Mealy M/C conversion. Limitations of FA.
-
Topic:01Context Free Languages: CFG, Leftmost and Rightmost derivations, Ambiguity, Simplification and Normalization (CNF & GNF) and Chomsky Hierarchy ( Types 0 to 3)
-
Topic:01Push Down Automata: Deterministic (single stack) PDA, Equivalence between PDA and CFG. Power and Limitations of PDA.
-
Topic:01Turing Machine: Deterministic TM, Variants of TM, Halting problem, Power of TM
-
Topic:01Applications of FA, CFG, PDA & TM. Introduction to Compiler & Its phases.
