Library for simulating deterministic finite Automata
-
Updated
Nov 29, 2018 - Haskell
Library for simulating deterministic finite Automata
Simple implementation of Mu-Recursive (or µ-recursive) functions in haskell, with the calculation steps logged.
Implementation of the calculus Featherweight Java (Principles and Paradigms of Programming Languages a.y. 2018/2019).
Minimization of DFA using equivalence theorem, written 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 theoretical-computer-science topic page so that developers can more easily learn about it.
To associate your repository with the theoretical-computer-science topic, visit your repo's landing page and select "manage topics."