Finite Automata Courses and Certifications

Models of Consciousness Conferences

Finite Automata as a Tool for Modeling Psychological Phenomena

1 rating

Explore how finite automata can effectively model psychological theories, focusing on stress and cognitive processes through clear mathematical frameworks and comparative analysis techniques.

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

Automata Theory

20 ratings

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/week
• Self-Paced
• Free Online Course (Audit)

Sundeep Saradhi Kanthety

Conversion of NFA with Epsilon to NFA Without Epsilon in Automata Theory

1 rating

Learn to convert NFA with epsilon transitions to NFA without epsilon, a crucial skill in automata theory. Understand the step-by-step process and its importance in simplifying finite automata representations.

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

Erwin Schrödinger International Institute for Mathematics and Physics (ESI)

Automatic Proofs in Combinatorial Game Theory

Discover how to use the automatic theorem-prover Walnut for combinatorial game theory, focusing on Wythoff's game and its variations, Beatty sequences, and numeration systems with automaton-recognizable addition.

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

Hausdorff Center for Mathematics

A Strong Version of Cobham's Theorem

Explore advanced mathematical logic through Cobham's theorem and its strengthening, examining k-recognizable sets and their computational complexity in Presburger arithmetic.

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

JSConf

Simplifying Complex UIs with Finite Automata & Statecharts

Explore finite automata and statecharts to manage complex UI states, enhancing app robustness and visualization. Learn innovative techniques for implementation, testing, and automation with practical demos.

• YouTube
• 34 minutes
• Self-Paced
• Conference Talk

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

Instituto de Física Interdisciplinar y Sistemas Complejos (IFISC)

Stochastic Thermodynamics of Boolean Circuits, Finite Automata and Turing Machines

Explore stochastic thermodynamics applied to computational models, including Boolean circuits, finite automata, and Turing machines.

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

NPTEL;  IIT Kanpur

Theory of Computation

6 ratings

Explore finite automata, regular languages, context-free grammars, and Turing machines. Learn about computational models, their properties, and fundamental concepts in theoretical computer science.

• YouTube
• 1 day 15 hours
• Self-Paced
• Free Video

University of London;  Goldsmiths University of London

Algorithms and Complexity

Algorithms and complexity are at the heart of computer science, shaping how we design solutions and measure efficiency. This course provides a rigorous introduction to both the theory and practice of algorithms. You’ll begin with automata theory, explori…

• Coursera
• 19 hours 14 minutes
• Self-Paced
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Automata and Computability

Explore theoretical computation models including finite automata, Turing machines, and complexity theory to understand computational limits and formal language processing.

• Coursera
• 2 days 15 hours
• Self-Paced
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Formal Languages and Applications

Explore formal language theory, automata, and parsing algorithms to build lexical analyzers and language recognition systems for compilers and NLP applications.

• Coursera
• 2 days 13 hours 30 minutes
• Self-Paced
• Paid Course

Theory of Computation

Explore computability and complexity theory, covering languages, decidability, reducibility, computational measures, completeness, hierarchies, oracles, probabilistic computation, and interactive proof systems.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course