Finite relational semantics for language Kleene algebra with complement
From MaRDI portal
Cites work
- An application of games to the completeness problem for formalized theories
- Automata Studies. (AM-34)
- Completeness theorems for Kleene algebra with top
- Complexity hierarchies beyond elementary
- Concurrent Kleene algebra and its foundations
- Dot-depth of star-free events
- Existential calculi of relations with transitive closure: complexity and edge saturations
- Expressive power and succinctness of the positive calculus of binary relations
- scientific article; zbMATH DE number 4049066 (Why is no real title available?)
- scientific article; zbMATH DE number 3694622 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- scientific article; zbMATH DE number 3099365 (Why is no real title available?)
- scientific article; zbMATH DE number 7650824 (Why is no real title available?)
- Introduction to Relation Algebras
- Kleene algebra with domain
- Kleene algebra with equations
- Kleene algebra with hypotheses
- Notes on equational theories of relations
- On Hoare logic and Kleene algebra with tests
- On the calculus of relations.
- On the complexity of reasoning in Kleene algebra
- On the Complexity of the Equational Theory of Relational Action Algebras
- On the positive calculus of relations with transitive closure
- On tools for completeness of Kleene algebra with hypotheses
- Partial derivatives on graphs for Kleene allegories
- Petri automata
- Petri Automata for Kleene Allegories
- Relation algebras by games
- Reversible Kleene lattices
- The dot-depth hierarchy, 45 years later
- The equational theory of Kleene lattices
- The equational theory of union-free algebras of relations
- Undecidability of the positive calculus of relations with transitive closure and difference: hypothesis elimination using graph loops
- Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements
This page was built for publication: Finite relational semantics for language Kleene algebra with complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261449)