Automata101 — Computability Theory, Visually

An interactive, bilingual study guide for computation theory, formal languages and automata.

Live site

Visit the public GitHub Pages site: devcop95.github.io/automata101

The site is published from this repository and uses the repository name in its project URL.

What is included

• A structured review path from alphabets and strings to computability limits.
• Interactive stack and queue demonstrations with LIFO/FIFO operations.
• Deterministic finite automaton (DFA) simulator and acceptance quiz.
• Pushdown automaton (PDA) simulator for the language aⁿbⁿ.
• A browser-based automaton editor with JSON import/export and local persistence.
• A Turing machine simulator that increments binary numbers step by step.
• Chomsky hierarchy overview, glossary, worked examples and six guided exercises.
• A lightweight 2D fallback for environments where WebGL is unavailable.
• Reduced-motion support, keyboard navigation and responsive layouts.

Run locally

The project is a static site. Serve the project directory with any local HTTP server:

python -m http.server 8765

Then open http://127.0.0.1:8765/index.html.

If Node.js dependencies are installed, the Tailwind stylesheet can be rebuilt with:

npm install
npm run build:css

Version

Current release: v1.0.5

License

This project is licensed under the MIT License.