Verification framework for Deterministic Finite Automaton (DFA), written in Haskell.
-
Updated
Oct 10, 2019 - Haskell
Verification framework for Deterministic Finite Automaton (DFA), written in Haskell.
Minimization of DFA using equivalence theorem, written in Haskell
Finite Automata and Regular Expressions for Regular Languages in Haskell
My Haskell code for "252-0058-00L Formal Methods and Functional Programming" at ETH Zurich, Spring 2022.
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."