Cited in
(14)- Two-Way Automata in Coq
- Formally verified algorithms for upper-bounding state space diameters
- Regular language representations in the constructive type theory of Coq
- Graph theory in Coq: minors, treewidth, and isomorphisms
- A formalisation of finite automata using hereditarily finite sets
- Myhill-Nerode
- POSIX Lexing
- Presburger Automata
- Regular Sets
- Hotel Key Card
- Hereditarily Finite Sets
- MSO_Regex_Equivalence
- Regex_Equivalence
- Hereditarily finite sets in constructive type theory
This page was built for software: Finite Automata HF
