On some decidability questions concerning supports of rational series

DOI10.1016/j.ipl.2022.106290OpenAlexW4281722060MaRDI QIDQ2094367

Peter Kostolányi

Publication date: 28 October 2022

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

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

zbMATH Keywords

decidabilityformal languagesrational seriesweighted automatonPost's correspondence problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Handbook of weighted automata
• 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
• What's decidable about weighted automata?
• Weighted automata
• An algebraic characterization of semirings for which the support of every recognizable series is recognizable
• Sequential?
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• Rational and Recognisable Power Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some decidability questions concerning supports of rational series