Courses from 1000+ universities
A year ago, 2U had already laid off staff as it recentered its strategy around edX, which it acquired for $800M.
700+ Free Google Certifications
Maintaining a Mindful Life
Food as Medicine
Six Sigma: Define and Measure
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Learn Automata Theory, earn certificates with paid and free online courses from Stanford, IIT Madras, IIT Kharagpur, NPTEL and other top universities around the world. Read reviews to decide if a class is right for you.
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.
Explore system validation and design structurally sound embedded systems with EIT Digital's 3-week course. Learn about automata, behavioural equivalences, and error prevention.
Explore Cellular Automata and its applications in Biology and Physics with Coursera Project Network. Learn to create models using Golly and NetLogo software.
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…
Syllabus: Growing Neural Cellular Automata
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…
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…
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?…
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…
Syllabus: Games: From Logic and Automata to Algorithms 1
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
Introduction to Automata Theory, Languages and Computation
Theory of Automata/Computation, Formal Languages, DFA, NFA, CFG, CFL, Pushdown Automata, Turing Machine, Undecidability
Get personalized course recommendations, track subjects and courses with reminders, and more.