Equational elements in additive algebras

DOI10.1007/s002240000110zbMath0914.68118OpenAlexW2002309677WikidataQ127554458 ScholiaQ127554458MaRDI QIDQ1277364

Symeon Bozapalidis

Publication date: 21 June 1999

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000110

zbMATH Keywords

additive algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Related Items (27)

Fuzzy tree automata ⋮ Weighted tree automata and weighted logics ⋮ Compositions of tree series transformations ⋮ Continuous monoids and semirings ⋮ PURE AND O-SUBSTITUTION ⋮ Unnamed Item ⋮ Convergence of Newton's method over commutative semirings ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Weighted monadic Datalog ⋮ Equational tree transformations ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Fuzzy tree language recognizability ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ Tree-Series-to-Tree-Series Transformations ⋮ Myhill-Nerode Theorem for Recognizable Tree Series Revisited ⋮ From Tree Automata to Rational Tree Expressions ⋮ RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Equational Weighted Tree Transformations with Discounting ⋮ BOOLEAN FUZZY SETS ⋮ Equational weighted tree transformations ⋮ Hierarchies of tree series transformations ⋮ Minimizing deterministic weighted tree automata ⋮ A Mezei-Wright theorem for categorical algebras ⋮ Context-free series on trees ⋮ A Fully Equational Proof of Parikh's Theorem

This page was built for publication: Equational elements in additive algebras