DC FieldValueLanguage
dc.contributor.authorBorchardt, Björnen_US
dc.contributor.authorMaletti, Andreasen_US
dc.contributor.authorŠešelja, Branimiren_US
dc.contributor.authorTepavčević, Andrejaen_US
dc.contributor.authorVogler, Heikoen_US
dc.date.accessioned2020-06-06T15:57:01Z-
dc.date.available2020-06-06T15:57:01Z-
dc.date.issued2006-06-01-
dc.identifier.issn0165-0114-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2835-
dc.description.abstractA 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.en_US
dc.publisherElsevieren_US
dc.relationGerman Research Foundation (DFG, GK 334/3)-
dc.relationSerbian Ministry of Science, Grant number 1227-
dc.relation.ispartofFuzzy Sets and Systemsen_US
dc.titleCut sets as recognizable tree languagesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.fss.2005.11.004-
dc.identifier.scopus2-s2.0-33646178987-
dc.relation.firstpage1560-
dc.relation.lastpage1571-
dc.relation.issue11-
dc.relation.volume157-
dc.description.rankM21-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-5716-604X-
Show simple item record

SCOPUSTM   
Citations

13
checked on May 22, 2024

Page view(s)

50
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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