Completeness theorems for Kleene algebra with tests and top
From MaRDI portal
(Redirected from Publication:6635510)
Cites work
- Algorithms for Kleene algebra with converse
- Axiomatizability of positive algebras of binary relations
- Complete systems of \(\mathcal B\)-rational identities
- Completeness for identity-free Kleene lattices
- Completeness theorems for Kleene algebra with top
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Elements of automata theory. Translated from the French by Reuben Thomas
- Equational properties of Kleene algebras of relations with conversion
- Equational theories of abnormal termination based on Kleene algebra
- scientific article; zbMATH DE number 1696821 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 3316967 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Kleene algebra with hypotheses
- Kleene algebra with tests and Coq tools for while programs
- Left-handed completeness
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
- Netkat, semantic foundations for networks
- Notes on equational theories of relations
- On Hoare logic and Kleene algebra with tests
- On the coalgebraic theory of Kleene algebra with tests
- On the equivalence, containment, and covering problems for the regular and context-free languages
- On the positive calculus of relations with transitive closure
- On tools for completeness of Kleene algebra with hypotheses
- On tools for completeness of Kleene algebra with hypotheses
- Partial derivatives of regular expressions and finite automaton constructions
- Partial derivatives on graphs for Kleene allegories
- Petri Automata for Kleene Allegories
- Programming Techniques: Regular expression search algorithm
- Proof Pearl: regular expression equivalence and relation algebra
- Relationships between nondeterministic and deterministic tape complexities
- The equational theory of Kleene lattices
- The equational theory of union-free algebras of relations
- Une condition impliquant toutes les identités rationnelles
- Une remarque sur les systèmes complets d'identités rationnelles
Cited in
(2)
This page was built for publication: Completeness theorems for Kleene algebra with tests and top
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635510)
