Algorithms for Kleene algebra with converse

DOI10.1016/J.JLAMP.2015.07.005MaRDI QIDQ299194zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

algorithmautomataconverseKleene algebraregular expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Equational classes, universal algebra in model theory (03C05)

Recommendations

• Kleene algebra with converse
• Reversible Kleene lattices
• Partial derivatives on graphs for Kleene allegories
• Equational properties of Kleene algebras of relations with conversion
• Automatic Proof Generation in Kleene Algebra

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 177804 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3316966 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Antichain algorithms for finite automata
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Checking NFA equivalence with bisimulations up to congruence
• Deciding Kleene algebras in \texttt{Coq}
• Enhancements of the bisimulation proof method
• Equational properties of Kleene algebras of relations with conversion
• Kleene algebra with converse
• Kleene algebra with tests and Coq tools for while programs
• Notes on equational theories of relations
• On the bisimulation proof method
• Partial derivatives of regular expressions and finite automaton constructions
• THE ABSTRACT THEORY OF AUTOMATA
• Term Rewriting and All That
• The equational theory of union-free algebras of relations
• Two Complete Axiom Systems for the Algebra of Regular Events
• Une condition impliquant toutes les identités rationnelles
• Une remarque sur les systèmes complets d'identités rationnelles
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)

Cited in

(8)

• Symbolic algorithms for language equivalence and Kleene algebra with tests
• Kleene algebra with converse
• On the positive calculus of relations with transitive closure
• An efficient Coq tactic for deciding Kleene algebras
• Partial derivatives on graphs for Kleene allegories
• scientific article; zbMATH DE number 408802 (Why is no real title available?)
• Equational properties of Kleene algebras of relations with conversion
• Completeness theorems for Kleene algebra with tests and top

Describes a project that uses

Uses Software

• Coq
• Antichains

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)