A simple free-form interpreted language for building Turing machines and other automata
regex finite-state-machine turing-machine nfa pushdown-automaton dfa turing-machine-simulator dfa-minimization deterministic-finite-automata deterministic-finite-automaton nondeterministic-finite-automata nfa-to-dfa-conversion pushdown-automata nfa-to-dfa
-
Updated
Dec 12, 2024 - C