Algorithms for Kleene algebra with converse

DOI10.1016/j.jlamp.2015.07.005zbMath1345.68223OpenAlexW1425245782WikidataQ114851597 ScholiaQ114851597MaRDI QIDQ299194

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

algorithmautomataregular expressionsconverseKleene algebra

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)

Related Items

Unnamed Item

Uses Software

• Coq
• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Equational properties of Kleene algebras of relations with conversion
• Notes on equational theories of relations
• The equational theory of union-free algebras of relations
• Deciding Kleene Algebras in Coq
• Checking NFA equivalence with bisimulations up to congruence
• THE ABSTRACT THEORY OF AUTOMATA
• Une remarque sur les systèmes complets d'identités rationnelles
• Antichain Algorithms for Finite Automata
• When Simulation Meets Antichains
• On the bisimulation proof method
• Une condition impliquant toutes les identités rationnelles
• Term Rewriting and All That
• Kleene Algebra with Tests and Coq Tools for while Programs
• Kleene Algebra with Converse
• Enhancements of the bisimulation proof method
• Two Complete Axiom Systems for the Algebra of Regular Events
• Antichains: A New Algorithm for Checking Universality of Finite Automata