What's New

DFA, NFA and PDA now have a Transitions tab next to the config editor: type the transition function directly (e.g. q0, a -> q1), with per-line validation and the diagram updating live as you go. New states are created automatically, and unused ones are pruned.

Export a diagram as LaTeX — the formal definition plus a tikz-automata drawing — copy it or download a .tex file. You can also render the transition function as formal δ-equations instead of a table, and choose the glyph used for ε when it isn't on your keyboard.

Adding transitions is now guided: on an NFA/DFA the target list narrows to the states still open for the chosen symbol, and a fully-wired symbol drops out entirely. You can also lock an edge or self-loop in place from its ⋯ menu — or unlock it to hand the layout back to auto-routing.

Turing machine transitions can now be added and removed directly on the diagram — with the same +/⋯ controls as the other automata — instead of only by editing the YAML configuration.

Each PDA move now pops the stack top (or ε) and pushes a single stack symbol (or ε) — the textbook definition, with no string-push shortcut (chain moves through extra states to push more). Add transitions from the diagram with guided dropdowns, and the config rejects any symbol outside the input or stack alphabet.

Add transitions with the + on a state, or remove them from an edge's ⋯ menu — directly on DFA, NFA, PDA and Turing machine diagrams. Every change is written straight back to the configuration.

Export any automaton as a PDF: the diagram, a formal definition (its n-tuple with a transition table), or both.

Algorithm visualizers now adapt to small screens — the info panel stacks above the diagram and the playback controls reflow to fit.

Previously the edge highlighting system was broken, hightliting all edges connected to the active node

Explore the hierarchy of coverage criteria and see when satisfying one guarantees another. Select a criterion to trace what it guarantees and what guarantees it.

Build control flow graphs from JavaScript or Java source and read off cyclomatic complexity, per function and across the module.

The whole site is now available in Hebrew, with full right-to-left layout. Switch languages from the menu.

Both controls were missing from the mobile menu and are now in its preferences section. The navigation drawer also opens from the correct side in Hebrew.

A new section covering combinatorial testing — AETG, IPO, and orthogonal arrays — with editable parameter models.

Algorithms moved under /algorithms, and every older link now redirects to its new home.

Stepping through a custom diagram kept resetting the zoom level. It now stays where you put it.

Convert a DFA into an equivalent regular expression, one state elimination at a time.

Computability and complexity, including worked reductions between classic problems.

Build and run PDAs, watching the stack change as input is consumed.

Convert a context-free grammar to Chomsky normal form, one transformation step at a time.

Answers to common questions about the visualizers and how to use them.

Build CFGs and derive strings step by step, with the parse tree drawn as it grows.

Build finite automata, run input through them one symbol at a time, and watch the active states light up.

Light and dark themes across the whole site, remembered between visits.

A page setting out what the site collects and why.

Define a machine in YAML and step through its execution, following the head as it reads and writes the tape.

The side panel on every visualizer can now be dragged to whatever width suits your screen.

Tower of Hanoi, closest pair of points, maximum subarray, and the median of two sorted lists.

Knapsack, longest common subsequence, and maximum subarray, with the table filled in cell by cell.

Binary search, linear search, and the median of two sorted arrays.

Bubble, insertion, bucket, merge, and quick sort, animated as bar charts with every comparison and swap shown.

What this site is for and who builds it.

BFS, DFS, Dijkstra, Bellman-Ford, and Ford-Fulkerson, on graphs you can edit and rearrange.

The first version of the site, with the interactive graph canvas the visualizers are built on.