The following pages link to (Q5596826):
Displayed 40 items.
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Free inductive \(K\)-semialgebras (Q383784) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings (Q604456) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Axiomatizing the identities of binoid languages (Q870834) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Complete systems of \(\mathcal B\)-rational identities (Q1177930) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring (Q1341738) (← links)
- Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- A note on identities of two-dimensional languages (Q1765373) (← links)
- Algebraically complete semirings and Greibach normal form (Q1772777) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- Equational theories of tropical semirings (Q1874279) (← links)
- The variety of Kleene algebras with conversion is not finitely based (Q1978513) (← links)
- Equational theories for automata (Q2074221) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Conway's work on iteration (Q2153969) (← links)
- Free Kleene algebras with domain (Q2210872) (← links)
- A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Axiomatizing rational power series over natural numbers (Q2389332) (← links)
- On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
- (Q3304097) (← links)
- Iteration Semirings (Q3532996) (← links)
- Nonfinite axiomatizability of the equational theory of shuffle (Q4645164) (← links)
- Completeness for Identity-free Kleene Lattices (Q5009432) (← links)
- Rewriting regular inequalities (Q5055882) (← links)
- (Q5079743) (← links)
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams (Q5883739) (← links)