On some decidability questions concerning supports of rational series
From MaRDI portal
Publication:2094367
DOI10.1016/J.IPL.2022.106290OpenAlexW4281722060MaRDI QIDQ2094367FDOQ2094367
Authors: 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
Recommendations
- Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable
- Rational series with coefficients in a commutative ring
- Rational relations and rational series
- What's decidable about weighted automata?
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Title not available (Why is that?)
- Noncommutative rational series with applications
- Sequential?
- Title not available (Why is that?)
- Rational and Recognisable Power Series
- 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
- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
- What's decidable about weighted automata?
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable
Cited In (3)
This page was built for publication: On some decidability questions concerning supports of rational series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094367)
