On the supports of recognizable series over a field and a single letter alphabet

DOI10.1016/j.ipl.2011.09.010zbMath1260.68247OpenAlexW2031160552MaRDI QIDQ1944212

Guillaume Chapuy, Ines Klimann

Publication date: 4 April 2013

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

Full work available at URL: https://hal-univ-diderot.archives-ouvertes.fr/hal-00663147/file/HAL_IPL4618.pdf

zbMATH Keywords

formal languagesrecognizable seriessupport of series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (2)

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
• Recognizability of the support of recognizable series over the semiring of the integers is undecidable
• A note on recurring series
• An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the supports of recognizable series over a field and a single letter alphabet