NFA to DFA converter, DFA minimization, FA acceptance in Haskell
a c++ program that takes a dfa as input and output its minimum equivalence states partitions and corresponding minimum state transition table.
AutoMinimizer is an interactive visualization tool designed to simplify the process of Deterministic Finite Automata (DFA) minimization using Myhill-Nerode.
Add a description, image, and links to the myhill-nerode-theorm topic page so that developers can more easily learn about it.
To associate your repository with the myhill-nerode-theorm topic, visit your repo's landing page and select "manage topics."