A Compact Proof of Decidability for Regular Expression Equivalence
From MaRDI portal
Publication:2914749
DOI10.1007/978-3-642-32347-8_19zbMATH Open1360.68738OpenAlexW46198887MaRDI QIDQ2914749FDOQ2914749
Authors: Andrea Asperti 
Publication date: 20 September 2012
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32347-8_19
Recommendations
- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- Deciding definability by deterministic regular expressions
- Deciding definability by deterministic regular expressions
- Extended regular expressions: succinctness and decidability
- Extended Regular Expressions: Succinctness and Decidability
- Unified decision procedures for regular expression equivalence
- scientific article; zbMATH DE number 871236
- A Finite Axiomatization of Nondeterministic Regular Expressions
- scientific article; zbMATH DE number 7774242
Cited In (16)
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- An SMT solver for regular expressions and linear arithmetic over string length
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- Title not available (Why is that?)
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- Testing the equivalence of regular languages
- Extended Regular Expressions: Succinctness and Decidability
- A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
- Proof Pearl: regular expression equivalence and relation algebra
- Title not available (Why is that?)
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Title not available (Why is that?)
- On regular expression proof complexity
- Deciding Kleene algebra terms equivalence in Coq
- Deciding regular expressions (in-)equivalence in Coq
- Unified decision procedures for regular expression equivalence
Uses Software
This page was built for publication: A Compact Proof of Decidability for Regular Expression Equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914749)
