Finite Automata Courses and Certifications

Sundeep Saradhi Kanthety

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

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
• On-Demand
• Free Video

Models of Consciousness Conferences

Finite Automata as a Tool for Modeling Psychological Phenomena

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
• On-Demand
• Free Video

Automata Theory

20 reviews

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 a week
• On-Demand
• Free Online Course (Audit)

Introduction to the Theory of Computing - Stanford

Explore fundamental concepts of theoretical computer science, including automata, computability, and complexity theory, with practical applications and algorithmic fairness.

• YouTube
• 20 hours
• On-Demand
• Free Video

Theory of Computation, Fall 2020

Explore computability and complexity theory with MIT's in-depth course. Covers automata, Turing machines, undecidability, NP-completeness, and advanced topics in computational theory.

• YouTube
• 1 day 8 hours
• On-Demand
• Free Video

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
• On-Demand
• Free Online Course

Formal Languages and Automata Theory

156 ratings at Udemy

Introduction to Automata Theory, Languages and Computation

• Udemy
• 31 hours
• On-Demand
• Paid Course

Theory of Automata and Computation

59 ratings at Udemy

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

• Udemy
• 3 hours 28 minutes
• On-Demand
• Paid Course

NPTEL;  IIT Kanpur

Theory of Computation

4 reviews

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
• On-Demand
• Free Video

IIT Kanpur;  NPTEL

Theory of Computation

2 reviews

Explore finite automata, regular expressions, context-free grammars, Turing machines, and complexity theory. Develop analytical skills in computational models and language classes.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Sundeep Saradhi Kanthety

Greibach Normal Form and Conversion of Context Free Grammar to GNF in Automata Theory

1 review

Explore Greibach Normal Form and learn how to convert context-free grammars to GNF. Gain insights into this important concept in automata theory and formal language processing.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Harbin Engineering University

Compilation Principle

Master the fundamentals of compiler design, from lexical analysis and parsing to code generation. Explore grammar types, runtime environments, and intermediate code techniques for building efficient compilers.

• XuetangX
• On-Demand
• Free Online Course

East China University of Science and Technology

Compilers Techniques

Master compiler construction fundamentals from lexical analysis to code generation, including hands-on implementation of a Python-based compiler and practical understanding of parsing techniques.

• XuetangX
• On-Demand
• Free Online Course

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
• On-Demand
• Free Video

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
• On-Demand
• Free Video