scientific article; zbMATH DE number 3316966
From MaRDI portal
Publication:5596826
zbMath0199.04302MaRDI QIDQ5596826
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
Equational theories of tropical semirings ⋮ A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring ⋮ Algorithms for Kleene algebra with converse ⋮ Nonfinite axiomatizability of the equational theory of shuffle ⋮ Axiomatizing recursion-free, regular monitors ⋮ Rewriting regular inequalities ⋮ Unnamed Item ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Conway's work on iteration ⋮ Axiomatizing rational power series over natural numbers ⋮ Bisimilarity is not finitely based over BPA with interrupt ⋮ Axiomatizing the identities of binoid languages ⋮ The equational theory of pomsets ⋮ Nested semantics over finite trees are equationally hard ⋮ Finite-trace linear temporal logic: coinductive completeness ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Algebraic notions of nontermination: Omega and divergence in idempotent semirings ⋮ Free inductive \(K\)-semialgebras ⋮ The equational logic of fixed points ⋮ The multiplicative fragment of the Yanov equational theory ⋮ On the equational definition of the least prefixed point. ⋮ Free Kleene algebras with domain ⋮ Iteration Semirings ⋮ Complete systems of \(\mathcal B\)-rational identities ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ The variety of Kleene algebras with conversion is not finitely based ⋮ Partial derivatives of regular expressions and finite automaton constructions ⋮ Completeness for Identity-free Kleene Lattices ⋮ A note on identities of two-dimensional languages ⋮ Structural properties of XPath fragments ⋮ Unnamed Item ⋮ Algebraically complete semirings and Greibach normal form ⋮ On the complexity of reasoning in Kleene algebra ⋮ On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based ⋮ Equational theories for automata ⋮ On equations for union-free regular languages ⋮ On the fine-structure of regular algebra ⋮ Abstract abstract reduction
This page was built for publication:
