Automata & Formal Languages Courses and Certifications

Code Sync

Cellular Automata for Video Games

A five-part cellular automata model shows how video game phenomena can be represented in code.

• YouTube
• 19 minutes
• Self-Paced
• Free Video

Wolfram

Adaptive Evolution in Totalistic Cellular Automata

Rule vectors mutate so finite lifeforms in a one-dimensional totalistic cellular automaton can evolve toward the largest possible evolution.

• YouTube
• 17 minutes
• Self-Paced
• Free Video

Theory of Computation

1 rating

उदाहरणों के जरिए DFA और NFA बनाना व बदलना सीखते हुए पाठ्यक्रम आगे PDA और Turing machine तक जाता है।

• YouTube
• 10 hours
• Self-Paced
• Free Video

5 Minutes Engineering

Theory of Computation - Complete Course

1 rating

हिंदी में DFA, NFA, पुशडाउन ऑटोमाटा और ट्यूरिंग मशीनों का सिद्धांत, निर्माण और उदाहरणों के साथ अध्ययन करें।

• YouTube
• 8 hours 28 minutes
• Self-Paced
• Free Video

Neso Academy

Compiler Design

8 ratings

Work through grammar ambiguity, recursion, precedence, and LL(1) parsing problems, then follow compilation through code generation and optimization.

• YouTube
• 6 hours 58 minutes
• Self-Paced
• Free Video

软件理论基础

本课程介绍形式语言、自动机、文法、可判定性问题及计算复杂性。

• XuetangX
• Self-Paced
• Free Online Course

有限自动机理论

以形式语言、有限自动机、下推自动机和图灵机构建计算模型，训练计算理论中的抽象推理能力。

• XuetangX
• Self-Paced
• Free Online Course

Career Certificate

Foundations of Autonomous Systems

41 ratings at Coursera

Model autonomous systems with state-space representations, timed and hybrid automata, specify requirements in linear temporal logic, and verify and synthesize controllers using Lyapunov theory and model checking.

• Coursera
• 16 weeks, 10 hours a week
• Self-Paced
• Paid Course
• 3 courses

Verification and Synthesis of Autonomous Systems

13 ratings at Coursera

Verify autonomous systems against stability and ω-regular properties using Lyapunov theory, reachability analysis, barrier certificates and model checking, then synthesize LTL controllers via abstraction and refinement.

• Coursera
• 4 weeks, 3 hours a week
• Self-Paced
• Paid Course

Requirement Specifications for Autonomous Systems

12 ratings at Coursera

Formally specify autonomous system requirements: prove stability with Lyapunov's theorem, over-approximate reachable sets using zonotopes, and build NFAs, Büchi automata, and linear temporal logic formulae.

• Coursera
• 5 weeks, 2 hours a week
• Self-Paced
• Paid Course

Reward Programming: Optimizing RL Efficiency and Safety

Reward design is a specification problem, not numerical tuning: express objectives with temporal logic, automata, and reward machines, infer rewards from demonstrations and preferences, and audit for safety.

• Coursera
• 5 weeks, 3 hours a week
• Self-Paced
• Paid Course

University of London;  Goldsmiths University of London

Algorithms and Complexity

Study finite automata and languages, implement sorting and binary search, design recursive and iterative algorithms, and analyse efficiency with Big O and the master theorem.

• Coursera
• 4 weeks, 5 hours a week
• Self-Paced
• Paid Course

Theory of Computation

Study computability and complexity: finite automata, regular and context-free languages, Turing machines, undecidability, NP-completeness, space complexity, hierarchy theorems, probabilistic computation, and interactive proof systems.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course

5 Minutes Engineering

Complete Theory of Computation - 6 Hour Course in Hindi

सीमित ऑटोमेटा से ट्यूरिंग मशीनों और निर्णेयता तक संगणना के सैद्धांतिक मॉडल एक छह घंटे के पाठ में।

• YouTube
• 6 hours
• Self-Paced
• Free Video

NLogSpace

NEA zu RegEx mit Ardens Lemma

Erlernen Sie die Anwendung von Ardens Lemma zur Umwandlung von nichtdeterministischen endlichen Automaten in reguläre Ausdrücke anhand praktischer Beispiele.

• YouTube
• 30 minutes
• Self-Paced
• Free Video