Roadmap

Roadmap

AutomataLab's goal is to grow from an automata simulator into a complete visual learning environment for computational theory. This page tracks what's shipped and what's planned. For the detailed per‑release history, see the Changelog.

Shipped

v4.x — algorithms & export ✅

• NFA → DFA conversion (subset construction) and DFA minimisation.
• Image export of the diagram as PNG / SVG.
• Step player, ε-inserter, and improved edge routing.

v3.0.0 — the Chomsky hierarchy is complete ✅

• Turing Machines and Linear‑Bounded Automata with a live tape panel, reject states, a configurable blank symbol, and a step‑limit loop guard.
• Multi‑tape Turing machines.
• Transition (δ) table editor.
• Data export — transition table (CSV/LaTeX), trace (CSV/JSON), computation tree (JSON), definition (JSON).
• Batch / test‑suite runner with accept: / reject: expectations.
• Declared stack/tape alphabets (Γ) and a Complete DFA quick‑fix.
• Honest computation trellis for NFA/ε‑NFA, a canvas tool palette, an accessibility pass, and large‑input performance work.

v2.x — pushdown automata & UX ✅

• DPDA / NPDA with a live stack panel and the computation‑tree viewer.
• Undo/redo, light/dark themes, toasts, onboarding, ELK auto‑layout, redesigned file controls, and an unsaved‑changes guard.

v1.x — foundation ✅

• DFA / NFA / ε‑NFA design and simulation, interactive canvas, multi‑tab editing, file save/load, real‑time validation, execution history, and working over‑the‑air auto‑updates.

Planned

Analytical & educational tools

• Regex integration — generate an NFA/DFA from a regular expression (and ideally back).

Visual exports & reach

• Continued web‑version parity, leveraging the UI‑independent engine.

Have an idea or a request? Open an issue on the tracker.