An algebraic characterization of semirings for which the support of every recognizable series is recognizable

DOI10.1016/j.tcs.2014.02.035zbMath1358.68203OpenAlexW2088421253MaRDI QIDQ2447754

Daniel Kirsten

Publication date: 29 April 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.035

zbMATH Keywords

semiringsformal power seriesrecognizable languages

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semirings (16Y60)

Related Items (5)

Bideterministic weighted automata ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ Bideterministic weighted automata ⋮ Weighted automata ⋮ On some decidability questions concerning supports of rational series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• On some questions of rationality and decidability
• On rational series and rational languages
• On the supports of recognizable series over a field and a single letter alphabet
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• On the definition of a family of automata
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Algebraic automata and context-free sets

This page was built for publication: An algebraic characterization of semirings for which the support of every recognizable series is recognizable