Automata & Formal Languages Courses and Certifications

NPTEL;  IIT Madras

Theory of Automata, Formal Languages and Computation

10 ratings

Explore automata theory, formal languages, and computation through grammars, finite state automata, pushdown automata, Turing machines, and advanced topics in theoretical computer science.

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

Sundeep Saradhi Kanthety

Automata Theory and Formal Languages - Complete Course

Master finite automata, regular expressions, context-free grammars, and pushdown automata through comprehensive examples and conversions in this complete theory of computation guide.

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

Introduction to Complexity

151 ratings

In this course you'll learn about the tools used by scientists to understand complex systems. The topics you'll learn about include dynamics, chaos, fractals, information theory, self-organization, agent-based modeling, and networks.

• Complexity Explorer
• 10 weeks, 3-6 hours a week
• Self-Paced
• Free Certificate

• Best of All Time

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

Sundeep Saradhi Kanthety

Automata Theory and Formal Languages Made Simple - Complete Course

2 ratings

Master finite automata, regular expressions, context-free grammars, and pushdown automata through practical examples and step-by-step problem solving in this comprehensive theory of computation tutorial.

• YouTube
• 9 hours 50 minutes
• Self-Paced
• Free Video

System Validation: Automata and behavioural equivalences

183 ratings at Coursera

Explore automata and behavioral equivalences for system validation. Learn to model and analyze system behavior, understand equivalences, and design structurally sound embedded systems.

• Coursera
• 3 hours 50 minutes
• Self-Paced
• Paid Course

Puppets and Automata: Art, Anxiety, and the Uncanny (Live Online)

33 ratings at CourseHorse

Explore the captivating world of puppets and automata, delving into their roles as artistic marvels and cultural symbols of fascination and unease.

• CourseHorse
• 12 hours
• Self-Paced
• $335.00

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

Coding Train

Context-Free Grammar - Programming with Text - Session 7

Explore context-free grammar techniques using Tracery and RiTa.js to generate dynamic text and create fractal tree visualizations through recursive programming methods.

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

Processing Foundation

The Nature of Code

14 ratings

Explore programming strategies for simulating natural systems, covering physics, fractals, genetic algorithms, and more using p5.js. Learn to create digital worlds inspired by nature's unpredictable properties.

• Kadenze
• 30 hours
• Self-Paced
• Free Online Course

Sundeep Saradhi Kanthety

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

1 rating

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

Sundeep Saradhi Kanthety

Conversion of Finite Automata to Regular Expression Using Arden's Method in Automata Theory

1 rating

Learn to convert finite automata to regular expressions using Arden's method in automata theory. Explore step-by-step process with examples to master this important concept in theoretical computer science.

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

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

Yannic Kilcher

Growing Neural Cellular Automata

Explore neural cellular automata that learn to grow complex patterns through local interactions, mimicking biological morphogenesis and self-organization in a fascinating, interactive model.

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