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...
Gespeichert in:
Veröffentlicht in: | Acta cybernetica (Szeged) 2011-01, Vol.20 (2), p.211-221 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0324-721X |
DOI: | 10.14232/actacyb.20.2.2011.1 |