Kirsten Daniel: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. In: Acta cybernetica, (20) 2. pp. 211-221. (2011)
Preview |
Cikk, tanulmány, mű
actacyb_20_2_2011_1.pdf Download (166kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2011 |
| Volume: | 20 |
| Number: | 2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 211-221 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | Weighted Automata : Theory and Applications (2010) (Leipzig) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38532/ |
| DOI: | 10.14232/actacyb.20.2.2011.1 |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 220-221. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:24 |
| Last Modified: | 2022. Jun. 17. 13:47 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12908 |
Actions (login required)
 |
View Item |
