The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable

DOI10.14232/ACTACYB.20.2.2011.1zbMath1265.68103OpenAlexW2398510482MaRDI QIDQ2915544

Daniel Kirsten

Publication date: 18 September 2012

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.20.2.2011.1

zbMATH Keywords

supportweighted automatarecognizable series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (12)

Weighted tree automata with constraints ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Weighted two-way transducers ⋮ Weighted two-way transducers ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings ⋮ Solving the Weighted HOM-Problem With the Help of Unambiguity ⋮ Weighted tree automata with constraints ⋮ Weighted automata with storage ⋮ Weighted restarting automata ⋮ Weighted Symbolic Automata with Data Storage ⋮ Weighted automata

This page was built for publication: The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable