Unified decision procedures for regular expression equivalence
From MaRDI portal
Recommendations
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A Compact Proof of Decidability for Regular Expression Equivalence
- Deciding regular expressions (in-)equivalence in Coq
- Proof Pearl: regular expression equivalence and relation algebra
- Verified decision procedures for MSO on words based on derivatives of regular expressions
Cited in
(23)- Manipulation of regular expressions using derivatives: an overview
- Location based automata for expressions with shuffle
- A mesh of automata
- On the fine-structure of regular algebra
- Derivatives and partial derivatives for regular shuffle expressions
- Two-Way Automata in Coq
- A Compact Proof of Decidability for Regular Expression Equivalence
- Deciding regular expressions (in-)equivalence in Coq
- Deciding synchronous Kleene algebra with derivatives
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A formalisation of finite automata using hereditarily finite sets
- Regex_Equivalence
- Quotients of bounded natural functors
- Quotients of Bounded Natural Functors
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- scientific article; zbMATH DE number 3211094 (Why is no real title available?)
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- scientific article; zbMATH DE number 7649960 (Why is no real title available?)
- Location automata for regular expressions with shuffle and intersection
- Pumping, with or without choice
- Relations between equation automata and follow automata
- Finiteness of symbolic derivatives in Lean
This page was built for publication: Unified decision procedures for regular expression equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879269)
