|Title:||Cut sets as recognizable tree languages||Journal:||Fuzzy Sets and Systems||Volume:||157||Issue:||11||First page:||1560||Last page:||1571||Issue Date:||1-Jun-2006||Rank:||M21||ISSN:||0165-0114||DOI:||10.1016/j.fss.2005.11.004||Abstract:||
A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzified recognizable tree language. In this sense, sufficient conditions are presented which, when imposed, ensure that every cut set, i.e., the pre-image of a prime filter of the carrier set, is a recognizable tree language. Moreover, such conditions are also presented for cut sets of recognizable tree series.
|Publisher:||Elsevier||Project:||German Research Foundation (DFG, GK 334/3)
Serbian Ministry of Science, Grant number 1227
Show full item record
checked on Dec 5, 2022
checked on Dec 9, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.