Cut sets as recognizable tree languages

Bjoern Borchardt; Andreas Maletti; Branimir Seselja; Andreja Tepavcevic; Heiko Vogler

首页> 外文期刊>Fuzzy sets and systems >Cut sets as recognizable tree languages

【24h】

Cut sets as recognizable tree languages

机译：切集作为可识别的树语言

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

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.

机译：具有部分排序的载波集的半环上的树序列可以视为模糊集。我们研究了在哪些情况下也可以将其理解为可识别的模糊树语言。从这个意义上讲，提供了足够的条件，当施加条件时，这些条件确保每个剪切集，即载体集的主滤波器的原像都是可识别的树语言。此外，还为可识别树系列的割集提供了这种条件。

著录项

来源
《Fuzzy sets and systems》 |2006年第11期|p.1560-1571|共12页
作者
Bjoern Borchardt; Andreas Maletti; Branimir Seselja; Andreja Tepavcevic; Heiko Vogler;
展开▼
作者单位

Department of Computer Science, Dresden University of Technology, D-01062 Dresden, Germany;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类模糊数学;
关键词

相似文献

外文文献
中文文献
专利

1. Descendants of a recognizable tree language for sets of linear monadic term rewrite rules [J] . Sandor Vagvoelgyi Information Processing Letters . 2006,第3期

机译：线性单子项重写规则集的可识别树型语言的后代
2. Linear-time Recognizable Classes Of Tree Languages By Deterministic Linear Pushdown Tree Automata [J] . Akio FUJIYOSHI IEICE Transactions on Information and Systems . 2009,第2期

机译：确定性线性下推树自动机的树形语言的线性时间可识别类
3. Characterizations of recognizable weighted tree languages by logic and bimorphisms [J] . Zoltán Fül?p, Heiko Vogler Soft computing: A fusion of foundations, methodologies and applications . 2018,第4期

机译：逻辑和黑色形态学的可识别加权树语语言的特征
4. Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages [C] . Gregory M. Kobele Logical aspects of computational linguistics . 2011

机译：极简树型语言在与可识别树型语言的交点下关闭
5. Image-set, Temporal and Spatiotemporal Representations of Videos for Recognizing, Localizing and Quantifying Actions [D] . Xiang, Xiang. 2018

机译：用于识别，定位和量化动作的视频的图像集，时间和时空表示
6. Context-free pairs of groups II — Cuts tree sets and random walks [O] . Wolfgang Woess -1

机译：第II组的上下文无关对-剪切树集和随机游走
7. Cut Sets as Recognizable Tree Languages [O] . Björn Borchardt, Andreas Maletti, Heiko Vogler 2009

机译：剪切集作为可识别的树语言
8. Using SETS to Find Minimal Cut Sets in Large Fault Trees [R] . Worrell, R. B., Stack, D. W. 1978

机译：使用sETs查找大型故障树中的最小割集

Cut sets as recognizable tree languages

摘要

著录项

相似文献

相关主题

期刊订阅