GitHub / desi-ivanov / agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/desi-ivanov%2Fagda-regexp-automata
Stars: 7
Forks: 0
Open issues: 0
License: None
Language: Agda
Size: 840 KB
Dependencies parsed at: Pending
Created at: almost 5 years ago
Updated at: about 2 years ago
Pushed at: over 4 years ago
Last synced at: about 2 years ago
Topics: agda, finite-state-machine, regular-expressions, theorem-proving