Regular expression containment, coinductive axiomatization and computational interpretation
From MaRDI portal
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 2185708 (Why is no real title available?)
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- scientific article; zbMATH DE number 1183236 (Why is no real title available?)
- Translating regular expression matching into transducers
- Simple linear string constraints
- A Computational Interpretation of Context-Free Expressions
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- A coinductive equational characterisation of trace inclusion for regular processes
- scientific article; zbMATH DE number 3271521 (Why is no real title available?)
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- A contextual formalization of structural coinduction
- Proving language inclusion and equivalence by coinduction
This page was built for publication: Regular expression containment, coinductive axiomatization and computational interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408558)