Algorithms for Kleene algebra with converse
DOI10.1016/J.JLAMP.2015.07.005zbMATH Open1345.68223OpenAlexW1425245782WikidataQ114851597 ScholiaQ114851597MaRDI QIDQ299194FDOQ299194
Authors: Paul Brunet, Damien Pous 
Publication date: 22 June 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.07.005
Recommendations
Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Equational classes, universal algebra in model theory (03C05)
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- Partial derivatives of regular expressions and finite automaton constructions
- Checking NFA equivalence with bisimulations up to congruence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equational theory of union-free algebras of relations
- Title not available (Why is that?)
- Term Rewriting and All That
- Two Complete Axiom Systems for the Algebra of Regular Events
- Notes on equational theories of relations
- Deciding Kleene algebras in \texttt{Coq}
- Une remarque sur les systèmes complets d'identités rationnelles
- Antichain algorithms for finite automata
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
- Title not available (Why is that?)
- On the bisimulation proof method
- Une condition impliquant toutes les identités rationnelles
- Kleene algebra with tests and Coq tools for while programs
- Kleene algebra with converse
- Enhancements of the bisimulation proof method
- Title not available (Why is that?)
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Equational properties of Kleene algebras of relations with conversion
Cited In (8)
- On the positive calculus of relations with transitive closure
- Partial derivatives on graphs for Kleene allegories
- Title not available (Why is that?)
- An efficient Coq tactic for deciding Kleene algebras
- Equational properties of Kleene algebras of relations with conversion
- Symbolic algorithms for language equivalence and Kleene algebra with tests
- Completeness theorems for Kleene algebra with tests and top
- Kleene algebra with converse
Uses Software
This page was built for publication: Algorithms for Kleene algebra with converse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299194)
