This small algo project allows you to tackle the problems of self-replication, and confronts you with the recursion theorem of Kleene!

Kleene Algebra (Kozen axioms)

A regular grammar and finite automaton evaluator

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.

Programa que calcula el Nivel de Cerradura de Kleene de un lenguaje dado

Kleene Logic in purescript