Recognizability of the support of recognizable series over the semiring of the integers is undecidable

DOI10.1016/J.IPL.2011.02.014zbMath1260.68208OpenAlexW1984461846MaRDI QIDQ1944933

Daniel Kirsten, Karin Quaas

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.02.014

zbMATH Keywords

formal languagesformal power seriesweighted automatasupportsPost's correspondence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the supports of recognizable series over a field and a single letter alphabet ⋮ On some decidability questions concerning supports of rational series

Cites Work

• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Rational and Recognisable Power Series
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizability of the support of recognizable series over the semiring of the integers is undecidable