This small algo project allows you to tackle the problems of self-replication, and confronts you with the recursion theorem of Kleene!
-
Updated
Dec 4, 2018 - Assembly
This small algo project allows you to tackle the problems of self-replication, and confronts you with the recursion theorem of Kleene!
A regular grammar and finite automaton evaluator
Kleene Logic in purescript
Transforms DFA to regex and regex to DFA and NFA. (Finite State Machines) Demonstrate is done using the Kleene theorem. In addition, a comparison is made between the string sizes of the regular expressions obtained from converting DFA with a reduction.
A standard library for claims that might be wrong: three-valued verdicts where 'not enough to say' is a first-class answer, not a collapsed False.
To associate your repository with the kleene topic, visit your repo's landing page and select "manage topics."