Cited in
(12)- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Two-Way Automata in Coq
- Regular language representations in the constructive type theory of Coq
- Unified decision procedures for regular expression equivalence
- Logic programming approach to automata-based decision procedures
- Myhill-Nerode
- Presburger Automata
- Regular Sets
- Finite Automata HF
- Hereditarily Finite Sets
- Regex_Equivalence
- Derivatives for Enhanced Regular Expressions
This page was built for software: MSO_Regex_Equivalence
