logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Cut sets as recognizable tree languages

delete2006-06-01
delete16
PRE
AI
B
Björn Borchardt
A
Andreas Maletti
B
Branimir Šešelja
A
Andreja Tepavčević *
H
Heiko Vogler
DOI：10.1016/j.fss.2005.11.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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. (C) 2005 Elsevier B.V. All rights reserved.
Keywords:
FUZZY-SETS
ORDERED STRUCTURES
AUTOMATA
REPRESENTATIONS
SERIES
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Fuzzy Sets and Systems cover
Fuzzy Sets and Systems
IF:
2.7
Papers:
7.6K
Citations:
1.5W

Organization

No organization information available