<div class="csl-bib-body">
<div class="csl-entry">Droste, M., & Kuich, W. (2024). Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings. <i>Theoretical Computer Science</i>, <i>1002</i>, Article 114599. https://doi.org/10.1016/j.tcs.2024.114599</div>
</div>
-
dc.identifier.issn
0304-3975
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/209620
-
dc.description.abstract
We show that there is an effectively given zero-sum-free commutative semiring S, contained as the subsemiring of nonnegative elements in an effectively given commutative ordered ring, for which there are no procedures deciding, given a weighted finite automaton over S, whether its support is the language of all words or whether its support is infinite. In particular, by a result of D. Kirsten (2011), since S is zero-sum-free and commutative, the support is recognizable by a classical finite automaton, but such an automaton or even just a pushdown automaton for its support cannot be constructed effectively.