BETA

Simulations

Step through the algorithms your courses cover instead of just watching them. Every simulation runs entirely in your browser — nothing is uploaded.

41 of 41 live · more landing each week

Theory of Computation

CSE331

Automata, grammars and machines you can build and run on your own strings.

Fill in your own transition table, then step a string through it and see it accept or reject.

Give a cell as many targets as you like, then watch every branch run at once, epsilon moves included.

Write your own productions and expand the shortest leftmost derivation one step at a time.

An NFA with a stack. Write the rules for aⁿbⁿ and watch the stack do the counting a DFA cannot.

Write your own transition rules and run the head across the tape one move at a time.

Subset construction, one row at a time — the working, not just the answer.

Split accepting from non-accepting, then refine until no group splits. See which states merge and why.

Build a machine and flip it between DFA and NFA rules to see exactly what determinism costs you.