Automata & Formal Languages Courses and Certifications

Sundeep Saradhi Kanthety

Chomsky Normal Form and Conversion of CFG to CNF in Automata Theory

Learn to convert Context-Free Grammars to Chomsky Normal Form, a standardized format for simplifying and analyzing grammars in automata theory. Understand the steps and rules for this important transformation.

• YouTube
• 31 minutes
• Self-Paced
• 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
• 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

Write your own Operating System

Context-Free Grammars - LR(k) Grammars

Explore the LR-Technique for parser construction, covering state transitions, nonterminals, reduce conflicts, follow sets, and LR1 grammars.

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

Write your own Operating System

Context-Free Grammars

Learn about Context-Free Grammars, their role in parser and compiler design, and applications in programming languages. Gain practical advice and understand associativity concepts.

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

Alan Turing Institute

Learning Automata with Hankel Matrices - Borja Balle, Amazon Research Cambridge

Explore a unified framework for learning automata using Hankel matrices, covering query learning, spectral learning, and matrix completion algorithms with practical applications.

• YouTube
• 41 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

Learn With Jason

Build UI Components With State Machines

Learn to build UI components using state machines with Zag library. Explore component creation, state machine visualization, and hidden features in this comprehensive tutorial.

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

NPTEL-NOC IITM

Significance of Regular Languages and Regular Operations - Lecture 5

Explore regular languages, non-regular examples, and key operations like union, concatenation, and Kleene star to deepen understanding of formal language theory.

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

Wolfram

Exploring Formal-Language Syntax with Multiway Systems

Explore computational dynamics of formal-language syntax using multiway systems, focusing on substitution rules and visualization of various grammar types.

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

Complexity Explorer

Cellular Automata: Algorithmic Information Dynamics in Living Systems

Explore cellular automata, a computational model for complex systems, and their applications in studying causality and living systems from networks to cells.

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

NPTEL-NOC IITM

Logic Optimization: Sequential Logic and Finite State Machines - Part III

Explore sequential logic optimization through finite state machines, including state diagrams, minimization techniques, and encoding strategies for Moore and Mealy machines.

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

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

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

Colin O'Flynn

Course Review Lecture Part 3 - Aug 10, 2012

Comprehensive review of digital logic concepts including flip-flops, registers, counters, and finite state machines. Covers design processes and practical applications in digital systems.

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