Minimization of DFA using equivalence theorem, written in Haskell
haskell theoretical-computer-science automata-theory deterministic-finite-automata deterministic-finite-automaton
- Updated
Apr 12, 2021 - Haskell
Minimization of DFA using equivalence theorem, written in Haskell
Add a description, image, and links to the deterministic-finite-automaton topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automaton topic, visit your repo's landing page and select "manage topics."