Pages that link to "Item:Q1327385"
From MaRDI portal
The following pages link to A completeness theorem for Kleene algebras and the algebra of regular events (Q1327385):
Displaying 50 items.
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- Group axioms for iteration (Q1283821) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- A congruence on the semiring of normal tropical matrices (Q1654409) (← links)
- A cut-free cyclic proof system for Kleene algebra (Q1694471) (← links)
- Domain and range for angelic and demonic compositions (Q1734512) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Invariants and closures in the theory of rewrite systems (Q1815344) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- Typing theorems of omega algebra (Q1931900) (← links)
- Left omega algebras and regular equations (Q1931903) (← links)
- In praise of algebra (Q1941861) (← links)
- Dijkstra, Floyd and Warshall meet Kleene (Q1941863) (← links)
- Models of nondeterministic regular expressions (Q1970200) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Explaining safety failures in NetKAT (Q2043810) (← links)
- Equational theories for automata (Q2074221) (← links)
- A semantics and a logic for \textit{Fuzzy Arden Syntax} (Q2099984) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Override and update (Q2200953) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Free Kleene algebras with domain (Q2210872) (← links)
- A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← links)
- Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- Left-handed completeness (Q2286746) (← links)
- Extended transitive separation logic (Q2347905) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- Completeness results for omega-regular algebras (Q2347912) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Factor theory and the unity of opposites (Q2374299) (← links)
- An exercise on the generation of many-valued dynamic logics (Q2374313) (← links)
- Axiomatizing rational power series over natural numbers (Q2389332) (← links)
- Inductive semimodules and the vector modules over them. (Q2391239) (← links)
- Proof Pearl: regular expression equivalence and relation algebra (Q2392416) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
- Graded epistemic logic with public announcement (Q2669241) (← links)
