On some decidability questions concerning supports of rational series
type: Item
instance of: scholarly article
title: On some decidability questions concerning supports of rational series
author: Peter Kostolányi
published in: Information Processing Letters
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7609042
zbMATH Keywords: rational series
zbMATH Keywords: weighted automaton
zbMATH Keywords: decidability
zbMATH Keywords: Post's correspondence problem
zbMATH Keywords: formal languages
MaRDI profile type: Publication
full work available at URL: j.ipl.2022.106290
OpenAlex ID: W4281722060
cites work: What's decidable about weighted automata?
cites work: Q3056218
cites work: On the supports of recognizable series over a field and a single letter alphabet
cites work: Handbook of weighted automata
cites work: Weighted automata
cites work: Q4423053
cites work: Q4079524
cites work: Q3862379
cites work: Q4044675
cites work: An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
cites work: An algebraic characterization of semirings for which the support of every recognizable series is recognizable
cites work: Recognizability of the support of recognizable series over the semiring of the integers is undecidable
cites work: Sequential?
cites work: Q3644388
cites work: Rational and Recognisable Power Series
cites work: Q4194484
cites work: Q4155837
DOI: 10.1016/J.IPL.2022.106290
description: scientific article; zbMATH DE number 7609042