Equational theories for automata
type: Item
instance of: scholarly article
title: Equational theories for automata
publication date: 2022-02-04T00:00:00Z
review text: Summary: For the entire collection see [Zbl 1470.68001].
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 7469518
author: Zoltán Ésik
MaRDI profile type: Publication
cites work: Equational Axioms for Probabilistic Bisimilarity
cites work: A Fully Equational Proof of Parikh's Theorem
cites work: On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
cites work: Representations of distributive lattice-ordered semigroups with binary relations
cites work: Q3997112
cites work: Automata, Languages and Programming
cites work: Conjugacy and Equivalence of Weighted Automata and Functional Transducers
cites work: Equational properties of Kleene algebras of relations with conversion
cites work: Q3994777
cites work: Q5633660
cites work: Varieties of ordered algebras
cites work: Floyd-Hoare logic in iteration theories
cites work: Equational axioms for regular sets
cites work: Q5287508
cites work: Matrix and matricial iteration theories. I
cites work: Q4896924
cites work: Axiomatizing rational power series over natural numbers
cites work: Q5506336
cites work: Notes on equational theories of relations
cites work: Une remarque sur les systèmes complets d'identités rationnelles
cites work: Une condition impliquant toutes les identités rationnelles
cites work: Q4807830
cites work: Q4791839
cites work: On the Complexity of the Equational Theory of Relational Action Algebras
cites work: On Action Logic: Equational Theories of Action Algebras
cites work: Q5515373
cites work: Q5639639
cites work: Soundness and Completeness of an Axiom System for Program Verification
cites work: A note on equations for commutative regular languages
cites work: On equations for union-free regular languages
cites work: Q4692885
cites work: Kleene algebra with domain
cites work: Semirings and Formal Power Series
cites work: A Kleene-Schützenberger theorem for weighted timed automata
cites work: Q4079524
cites work: Simple program schemes and formal languages
cites work: Group axioms for iteration
cites work: Q2753681
cites work: Axiomatizing the equational theory of regular tree languages
cites work: A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
cites work: Q5422232
cites work: Inductive \(^{*}\)-semirings
cites work: Q3431479
cites work: On iteration semiring-semimodule pairs.
cites work: Finite Automata
cites work: Free iterative and iteration \(K\)-semialgebras
cites work: Free inductive \(K\)-semialgebras
cites work: Newtonian program analysis
cites work: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
cites work: Q4375630
cites work: Q4023553
cites work: Q4433737
cites work: Q3030266
cites work: Q5572358
cites work: Algebraic semantics
cites work: Q4525781
cites work: Q3201767
cites work: The complexity of equivalence problems for commutative grammars
cites work: Q4727433
cites work: From semirings to residuated Kleene lattices
cites work: Continuous monoids and semirings
cites work: Automata Studies. (AM-34)
cites work: Q3939782
cites work: Q3358736
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Q4362921
cites work: On the complexity of reasoning in Kleene algebra
cites work: On the completeness of propositional Hoare logic
cites work: Monoides et semi-anneaux complets. (Complete monoids and semirings)
cites work: Monoides et semi-anneaux continus. (Continuous monoids and semirings)
cites work: Complete systems of \(\mathcal B\)-rational identities

Equational theories for automata (cites work)
cites work: Q3975995

Equational theories for automata (cites work)
cites work: Matrix versions of aperiodic $K$-rational identities

Equational theories for automata (cites work)
cites work: Q3027187

Equational theories for automata (cites work)
cites work: Q3704880

Equational theories for automata (cites work)
cites work: Chain-complete posets and directed sets with applications

Equational theories for automata (cites work)
cites work: A calculus of communicating systems

Equational theories for automata (cites work)
cites work: A complete axiom system for rational sets with multiplicity

Equational theories for automata (cites work)
cites work: Q5624635

Equational theories for automata (cites work)
cites work: Q3907077

Equational theories for automata (cites work)
cites work: Q5317419

Equational theories for automata (cites work)
cites work: Q4395212

Equational theories for automata (cites work)
cites work: Dynamic algebras: Examples, constructions, applications

Equational theories for automata (cites work)
cites work: Q5596827

Equational theories for automata (cites work)
cites work: Q5596826

Equational theories for automata (cites work)
cites work: Q3996704

Equational theories for automata (cites work)
cites work: Two Complete Axiom Systems for the Algebra of Regular Events

Equational theories for automata (cites work)
cites work: Q5588675

Equational theories for automata (cites work)
cites work: Q4155837

Equational theories for automata (cites work)
cites work: Q5626549

Equational theories for automata (cites work)
cites work: Q4002149

Equational theories for automata (full work available at URL)
full work available at URL: https://doi.org/10.4171/automata-1/20

Equational theories for automata (OpenAlex ID)
OpenAlex ID: W4205618076

Equational theories for automata (DOI)
DOI: 10.4171/AUTOMATA-1/20