Automata Theory Courses and Certifications

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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• Free Video

HyperComplex Seminar

Pattern Explorer Tool for Testing CEP Patterns

Explore a tool for testing Complex Event Processing patterns through automata compilation and symbolic event sequence generation. Enhance pattern understanding and error detection in event streams.

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

Hausdorff Center for Mathematics

Challenges in Formalising Recent Results in Formal Language Theory

Explore challenges in formalizing recent results linking formal language theory and computational group theory, with insights on making proofs more amenable to formalization.

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

Center for Language & Speech Processing(CLSP), JHU

Weighted Finite State Automata and Linear Algebra - JSALT 2023 Team Presentation

Explore weighted finite state automata and linear algebra in speech and language processing through a comprehensive JSALT 2023 team presentation by Lucas Ondel Yang.

• YouTube
• 2 hours 36 minutes
• Self-Paced
• Free Video

Center for Language & Speech Processing(CLSP), JHU

How I Learned to Stop Worrying and Love Evaluations (and Keep Worrying)

Explore the benefits and challenges of coordinated evaluations in NLP research, focusing on recent work in low-resource languages and semantic parsing.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

Simons Institute

On Partial-Order and Automata Techniques for Analyzing Communication

Explores verification and synthesis techniques for peer-to-peer and mailbox communication in concurrent programming, focusing on message-passing models and their applications in distributed systems.

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

Simons Institute

From Fallible DFAs to DFA-Therapy and Things In-Between

Explore the theoretical foundations of fallible DFAs and their therapeutic applications, examining key concepts and intermediate developments in automata theory.

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

Centre International de Rencontres Mathématiques

An Introduction to Walnut - Lecture 1

Explore Walnut, a tool for automata-based decision procedures in number theory and combinatorics on words. Learn its applications and fundamental concepts.

• YouTube
• 1 hour 35 minutes
• Self-Paced
• Free Video

Centre International de Rencontres Mathématiques

An Introduction to Walnut - Lecture 2

Explore Walnut, a tool for automata-based proofs in number theory and combinatorics. Delve into advanced techniques and applications in this comprehensive mathematical lecture.

• YouTube
• 1 hour 38 minutes
• Self-Paced
• Free Video

ACM SIGPLAN

Complete Multiparty Session Type Projection with Automata - ST30

Explore efficient multiparty session type projection using automata. Learn sound, complete, and efficient techniques for verifying asynchronous communication protocols.

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

ACM SIGPLAN

Visualizing Why Nondeterministic Finite-State Automata Reject

Explore visual techniques for understanding rejection in nondeterministic finite-state automata, enhancing comprehension of complex computational concepts.

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

ACM SIGPLAN

On Learning Polynomial Recursive Programs

Explore P-finite automata, a generalization of weighted automata with polynomial transition weights. Learn about their polynomial-time learnability in Angluin's MAT exact learning model.

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

ACM SIGPLAN

Parikh's Theorem Made Symbolic - POPL'24

Explore Parikh's Theorem for symbolic automata, learning efficient algorithms for handling large or infinite alphabets in language processing and constraint solving.

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