Automata Theory Courses and Certifications

Automata Theory

20 reviews

Stanford University's 7-week course explores Automata Theory, covering finite automata, regular languages, context-free grammars, Turing machines, and intractable problems. Requires 5-10 hours/week.

• edX
• 5-10 hours a week, 7 weeks long
• Self paced
• Free Online Course (Audit)

System Validation: Automata and behavioural equivalences

181 ratings at Coursera

Explore system validation and design structurally sound embedded systems with EIT Digital's 3-week course. Learn about automata, behavioural equivalences, and error prevention.

• Coursera
• 4-5 hours worth of material, 3 weeks long
• On-Demand
• Free Online Course (Audit)

Introducing Cellular Automata

14 ratings at Coursera

Explore Cellular Automata and its applications in Biology and Physics with Coursera Project Network. Learn to create models using Golly and NetLogo software.

• Coursera
• 2-3 hours worth of material
• On-Demand
• Paid Course

NPTEL;  IIT Madras

Theory of Automata, Formal Languages and Computation

This course provides an introduction to the basic models of computability, covering topics like grammars, context-free grammars, finite state automata, and regular expressions, pushdown automata, Turing machines, decidability, complexity theory, DNA comp…

• YouTube
• 39 hours worth of material
• On-Demand
• Free Online Course

Yannic Kilcher

Growing Neural Cellular Automata

Syllabus: Growing Neural Cellular Automata

• YouTube
• Less than 1 hour of material
• On-Demand
• Free Online Course

Simons Institute

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

Syllabus: Intro Acknowledgements Reinforcement Learning (RL) Challenges of Real-World RL Goals and Preferences Linear Temporal Logic (LTL) A compelling logic to express temporal properties of traces. Challenges to RL Toy Problem Disclaimer Running Exampl…

• YouTube
• 1-2 hours worth of material
• On-Demand
• Free Online Course

Alan Turing Institute

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

Syllabus: Intro Brief History of Automata Learning Talk Outline From Hankel Matrices to DFA Closed and consistent Finite Hankel Matrices Learning from Membership and Equivalence Queries Weighted Finite Automata (WFA) Hankel Matrices and WFA From Hankel M…

• YouTube
• Less than 1 hour of material
• On-Demand
• Free Online Course

Ryan O'Donnell

Deterministic Finite Automata

Syllabus: 15-251: Great Theoretical Ideas in Computer Science Spring 2016, Lecture 2 Inspirational quotation #2 Example problem 1 Example problem 2: PALINDROME Example problem 3 Representing instances/solutions Representing problems What is computation?…

• YouTube
• 1-2 hours worth of material
• On-Demand
• Free Online Course

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Finite Automata (Spring 2015)

Syllabus: 15-251: Great Theoretical ideas in Computer Science Lecture 4 Inspirational quotation #2 Example problem 2 PALINDROME Example problem 3 String notation Representing problems What is computation? What is an algorithm? Deterministic Finite Automa…

• YouTube
• 1-2 hours worth of material
• On-Demand
• Free Online Course

Simons Institute

Games: From Logic and Automata to Algorithms 1

Syllabus: Games: From Logic and Automata to Algorithms 1

• YouTube
• Less than 1 hour of material
• On-Demand
• Free Online Course

IIT Kharagpur;  NPTEL

Introduction to Automata Languages and Computation

Automata, Languages and Computation have been an important part of the curriculum in computer science department for several decades.The automata theory is the study of abstract machines and theirapplication in solving computational problems

• Swayam
• 12 weeks long
• 22nd Jan, 2023
• Free Online Course

Formal Languages and Automata Theory

156 ratings at Udemy

Introduction to Automata Theory, Languages and Computation

• Udemy
• 31 hours worth of material
• On-Demand
• Paid Course

Theory of Automata and Computation

48 ratings at Udemy

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

• Udemy
• 3-4 hours worth of material
• On-Demand
• Paid Course