The following pages link to Presburger Automata (Q40317):
Displaying 8 items.
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments (Q3087999) (← links)
- A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) (Q3088018) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
