Abstract
We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Kirsten, D. (2009). The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5583 LNCS, pp. 326–333). https://doi.org/10.1007/978-3-642-02737-6_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
