Automata Theory Courses and Certifications

Automata Theory

20 reviews

Explore finite automata, context-free grammars, Turing machines, and intractable problems in this comprehensive study of theoretical computer science foundations.

• edX
• 7 weeks, 5-10 hours a week
• On-Demand
• Free Online Course (Audit)

System Validation: Automata and behavioural equivalences

182 ratings at Coursera

Explore automata and behavioral equivalences for system validation. Learn to model and analyze system behavior, understand equivalences, and design structurally sound embedded systems.

• Coursera
• 3 hours 50 minutes
• On-Demand
• Free Online Course (Audit)

Formal Languages and Automata Theory

156 ratings at Udemy

Introduction to Automata Theory, Languages and Computation

• Udemy
• 31 hours
• On-Demand
• Paid Course

Theory of Automata and Computation

59 ratings at Udemy

Theory of Automata/Computation, Formal Languages, DFA, NFA, CFG, CFL, Pushdown Automata, Turing Machine, Undecidability

• Udemy
• 3 hours 28 minutes
• On-Demand
• Paid Course

NPTEL;  IIT Madras

Theory of Automata, Formal Languages and Computation

1 review

Explore automata theory, formal languages, and computation through grammars, finite state automata, pushdown automata, Turing machines, and advanced topics in theoretical computer science.

• YouTube
• 1 day 15 hours
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Greibach Normal Form and Conversion of Context Free Grammar to GNF in Automata Theory

1 review

Explore Greibach Normal Form and learn how to convert context-free grammars to GNF. Gain insights into this important concept in automata theory and formal language processing.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Alan Turing Institute

Learning Automata with Hankel Matrices - Borja Balle, Amazon Research Cambridge

Explore a unified framework for learning automata using Hankel matrices, covering query learning, spectral learning, and matrix completion algorithms with practical applications.

• YouTube
• 41 minutes
• On-Demand
• Free Video

Simons Institute

Formal Languages and Automata for Reward Function Specification and Efficient Reinforcement Learning

Explore formal languages and automata for specifying reward functions in reinforcement learning, focusing on Linear Temporal Logic and Reward Machines to address real-world RL challenges.

• YouTube
• 1 hour 24 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Deterministic Finite Automata

Explore deterministic finite automata, their structure, and applications in computer science. Learn to construct DFAs, understand regular languages, and solve computational problems.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Finite Automata

Explore finite automata and regular languages in theoretical computer science, covering DFAs, computation concepts, and language analysis techniques.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Free Video

Fields Institute

Fractal Dimensions and Büchi Automata

Explore fractal dimensions and Büchi automata, delving into formal definitions, regular languages, and ω-languages. Discover applications in model theory and intriguing examples where dimensions diverge.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Paul G. Allen School

PLSE Seminar Series - The Power of Symbolic Automata

Explores symbolic automata, their applications in program verification, and novel decision procedures for equivalence checking and minimization of these powerful automata operating over infinite alphabets.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Conversion of Regular Expression to Finite Automata Using Subset Method in Automata Theory

Learn to convert regular expressions to finite automata using the subset method, covering NFA construction, epsilon transition removal, and DFA conversion in automata theory.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Conversion of Finite Automata to Regular Expression Using State Eliminating Method in Automata Theory

Learn to convert finite automata to regular expressions using the state elimination method, a crucial technique in automata theory for simplifying complex systems.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Conversion of Finite Automata to Regular Expression Using Arden's Method in Automata Theory

Learn to convert finite automata to regular expressions using Arden's method in automata theory. Explore step-by-step process with examples to master this important concept in theoretical computer science.

• YouTube
• 21 minutes
• On-Demand
• Free Video