A comprehensive suite for visualizing, simulating, and converting finite automata and regular expressions.
Interactive automata visualization and simulation. Build and test your automata.
Subset Construction → Lazy Evaluation algorithm. Visualize the conversion process.
N-Closure → Subset Construction → Lazy Evaluation for Epsilon-NFA.
Convert Regular Expressions to Epsilon-NFA.
Check if a string is accepted by RL (RegEx/NFA), CFL (CFG/CYK), or REL (Turing Machine). Step-by-step trace with Chomsky hierarchy.
More automata tools and converters in the future.