Minimization of DFA using equivalence theorem, written in Haskell
-
Updated
Apr 12, 2021 - Haskell
Minimization of DFA using equivalence theorem, written in Haskell
Verification framework for Deterministic Finite Automaton (DFA), written in Haskell.
My Haskell code for "252-0058-00L Formal Methods and Functional Programming" at ETH Zurich, Spring 2022.
Finite Automata and Regular Expressions for Regular Languages in Haskell
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."