| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 20, Number 2, 2011>>> |
 Magyarul
|
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
Abstract (in LaTeX format)
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.
Keywords: weighted automata, recognizable series, support.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Kirsten:2011:ActaCybernetica,author = {Daniel Kirsten},
title = {The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable},
journal = {Acta Cybernetica},
volume = {20},
number= {2},
pages = {211--221},
year = {2011},
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.},
keywords = {weighted automata, recognizable series, support}
}