An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable

DOI10.1007/978-3-642-03816-7_42zbMath1250.68201OpenAlexW1578641318MaRDI QIDQ3182949

Daniel Kirsten

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_42

zbMATH Keywords

formal power series

Mathematics Subject Classification ID

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

Related Items (4)

On the supports of recognizable series over a field and a single letter alphabet ⋮ Recognizability of the support of recognizable series over the semiring of the integers is undecidable ⋮ An algebraic characterization of semirings for which the support of every recognizable series is recognizable ⋮ On some decidability questions concerning supports of rational series

Cites Work

• Handbook of weighted automata
• On some questions of rationality and decidability
• On rational series and rational languages
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable