The support of a recognizable series over a zero-sum free, commutative semiring is recognizable

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...

Full description

Saved in:
Bibliographic Details
Main Author: Kirsten Daniel
Corporate Author: Weighted Automata : Theory and Applications (2010) (Leipzig)
Format: Article
Published: 2011
Series:Acta cybernetica 20 No. 2
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
doi:10.14232/actacyb.20.2.2011.1

Online Access:http://acta.bibl.u-szeged.hu/12908
Description
Summary: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.
Physical Description:211-221
ISSN:0324-721X