Pages that link to "Item:Q3088018"
From MaRDI portal
The following pages link to A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) (Q3088018):
Displaying 8 items.
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← 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)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- Certified Kruskal’s Tree Theorem (Q2938047) (← 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)
- A Verified Compositional Algorithm for AI Planning (Q5875407) (← links)
