返回
Cut sets as recognizable tree languages
DOI:10.1016/j.fss.2005.11.004.png)
摘要
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.
Keyword:
FUZZY-SETS
ORDERED STRUCTURES
AUTOMATA
REPRESENTATIONS
SERIES
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
暂无机构信息

