Authors: Šešelja, Branimir
Tepavčević, Andreja 
Vogler, Heiko
Title: A note on cut-worthiness of recognizable tree series
Journal: Fuzzy Sets and Systems
Volume: 159
Issue: 22
First page: 3087
Last page: 3090
Issue Date: 16-Nov-2008
Rank: M21a
ISSN: 0165-0114
DOI: 10.1016/j.fss.2008.02.009
The topic of this short note is tree series over semirings with partially ordered carrier set. Thus, tree series become poset-valued fuzzy sets. Starting with a collection of recognizable tree languages we construct a tree series recognizable over any semiring, such that the carrier set is a poset generated by the collection. In the framework of fuzzy structures, the starting collection becomes a subset of the collection of the corresponding cut sets. Under some stricter conditions, it is even equal to this collection. We also partially solve an open problem which was posed in Borchardt et al. [Cut sets as recognizable tree languages, Fuzzy Sets and Systems 157 (2006) 1560-1571]. Namely, we show that if φ{symbol} is a given tree series over a partially ordered, locally finite semiring A, then φ{symbol} is recognizable if and only if there are finitely many cut sets of φ{symbol} and every cut set is a recognizable tree language.
Keywords: Bottom-up finite state weighted tree automata | Cut sets | Cut-worthy approach | Poset (lattice)-valued fuzzy sets | Recognizable tree languages | Recognizable tree series | Semirings
Publisher: Elsevier
Project: Algebarske strukture i metode za procesiranje informacija, 144011
Provincial Secretariat for Science and Technological Development, Autonomous Province of Vojvodina, grant “Lattice methods and applications”

Show full item record


checked on Jan 30, 2023

Page view(s)

checked on Jan 31, 2023

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.