Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
Why do you think that https://github.com/ocaml/ocaml-re is a good alternative to agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
Why do you think that https://github.com/ocaml/ocaml-re is a good alternative to agda-regexp-automata