Interactive Theory of Computation course Automa
Finite automata from zero: states, inputs and arrows, then DFAs, NFAs and ε-NFAs up to the subset construction. Each idea is taught step by step, then you change the machine yourself, in 2D, 3D, Manim style or as slides.
- Scenes
- 35
- Level
- Undergraduate
- Guide
- Tok
- Kind
- Narrated scenes
What students work through
- States, inputs & arrows
- Strings & languages
- DFAs & design
- NFAs, ε-NFAs & subsets
Every scene in Automa follows the same pattern: a plain sentence saying what the idea is, a working model the student controls, a real example, then a “your turn” step.
The free preview opens the first 3 scenes in your browser. The full course comes with your college’s TwiddleLabs subscription: teachers use it in the browser, and students get it in the TwiddleLabs app on their phone and laptop, working offline.
From the blog
- 5 min readFinite automaton accept string – yes or noLearn how a deterministic finite automaton reads an input string, moves through states, and decides acceptance with a simple yes or no answer.
- 4 min readFinite Automaton States and Transitions ExplainedLearn what states, inputs, and arrows mean in a finite automaton, with simple examples, common mistakes, and check-yourself questions.
Other interactive courses
- Cogito · Artificial Intelligence
- Relata · Database Management Systems
- Bastion · Cyber Security
- Forge · Software Engineering
- Ordo · Data Structures & Algorithms
- Sentio · Internet of Things (Edge AI)
- Axiom · Algebra
- Chlora · Biology
- Flux · Calculus
- Elementa · Chemistry
- Reacta · Chemistry II
- Nimbus · Cloud Computing
- Volta · Electronics
- Helix · Genetics
- Pulse · Human Body
- Prism · Light & Optics
- Relay · Networking
- PyVisual · Python
- CVisual · C Programming
- Cosmos · Physics