Automata Theory
July 15, 2026
Details
Duration: 80 - 90 Hrs
Start Date: July 15, 2026
No. of Projects: 0
Certification Provided: Yes
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...
Curriculum
Introduction and Regular Languages
- Languages: Alphabets and Strings. Regular Languages: Regular Expressions, Regular
Finite Automata
- Finite Automata: FA as language acceptor or verifier, NFA ( with and without ε) , DFA, RE to NFA,
Context Free Grammars
- Context Free Languages: CFG, Leftmost and Rightmost derivations, Ambiguity, Simplification and
Push Down Automata
- Push Down Automata: Deterministic (single stack) PDA, Equivalence between PDA and CFG. Power and
Turing Machine
- Turing Machine: Deterministic TM, Variants of TM, Halting problem, Power of TM
Applications of Automata
- Applications of FA, CFG, PDA & TM. Introduction to Compiler & Its phases.
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...
Curriculum
Introduction and Regular Languages
- Languages: Alphabets and Strings. Regular Languages: Regular Expressions, Regular
Finite Automata
- Finite Automata: FA as language acceptor or verifier, NFA ( with and without ε) , DFA, RE to NFA,
Context Free Grammars
- Context Free Languages: CFG, Leftmost and Rightmost derivations, Ambiguity, Simplification and
Push Down Automata
- Push Down Automata: Deterministic (single stack) PDA, Equivalence between PDA and CFG. Power and
Turing Machine
- Turing Machine: Deterministic TM, Variants of TM, Halting problem, Power of TM
Applications of Automata
- Applications of FA, CFG, PDA & TM. Introduction to Compiler & Its phases.
Details
Duration: 80 - 90 Hrs
Start Date: July 15, 2026
No. of Projects: 0
Certification Provided: Yes