I built a canvas simulator for automata theory: DFA/NFA/PDA/Turing machines, regex to NFA conversion

Interactive canvas simulator for automata theory and computation theory. Build and run DFA/NFA, PDA/NDPA, Turing machines, Mealy/Moore machines, convert between representations, and collaborate with a team on a shared, real-time canvas.