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

Kirsten, Daniel: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta cybernetica, (20) 2. pp. 211-221. (2011)

[img] Cikk, tanulmány, mű
actacyb_20_2_2011_1.pdf

Download (166kB)

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
Event Title: Weighted Automata: Theory and Applications, 2010, Leipzig
Journal or Publication Title: Acta cybernetica
Date: 2011
Volume: 20
Number: 2
Page Range: pp. 211-221
ISSN: 0324-721X
Language: angol
DOI: https://doi.org/10.14232/actacyb.20.2.2011.1
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 220-221.; Abstract
Date Deposited: 2016. Oct. 15. 12:24
Last Modified: 2018. Jun. 05. 14:12
URI: http://acta.bibl.u-szeged.hu/id/eprint/12908

Actions (login required)

View Item View Item