The following pages link to Myhill-Nerode (Q40261):
Displaying 11 items.
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions (Q2851929) (← links)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) (Q3088018) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)
- A Mechanized Proof of Higman’s Lemma by Open Induction (Q3295156) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
- A Verified Compositional Algorithm for AI Planning (Q5875407) (← links)