A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
From MaRDI portal
Publication:3088018
DOI10.1007/978-3-642-22863-6_25zbMATH Open1342.68306OpenAlexW1500313939MaRDI QIDQ3088018FDOQ3088018
Authors: Chunhan Wu, Christian Urban, Xingyuan Zhang
Publication date: 17 August 2011
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22863-6_25
Recommendations
Cites Work
Cited In (12)
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- A Mechanized Proof of Higman’s Lemma by Open Induction
- Certified Kruskal's tree theorem
- A Verified Compositional Algorithm for AI Planning
- Formally verified algorithms for upper-bounding state space diameters
- Regular language representations in the constructive type theory of Coq
- Proof Pearl: regular expression equivalence and relation algebra
- Automated analysis of regular algebra
- Pumping, with or without choice
- Automated Reasoning in Higher-Order Regular Algebra
- A formalisation of finite automata using hereditarily finite sets
Uses Software
This page was built for publication: A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088018)