Fuzzy regular languages over finite and infinite words

Werner Kuich; George Rahonis

首页> 外文期刊>Fuzzy sets and systems >Fuzzy regular languages over finite and infinite words

【24h】

Fuzzy regular languages over finite and infinite words

机译：有限和无限词上的模糊常规语言

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

We consider finite automata over semirings and quemirings accepting finite and infinite words, respectively. We obtain Kleene theorems for fuzzy languages consisting of finite and infinite words. Furthermore, we introduce regular fuzzy grammars and linear fuzzy systems and we show that both of them specify the class of recognizable fuzzy languages consisting of finite and infinite words.

机译：我们考虑半环和quemirings分别接受有限和无限词的有限自动机。我们获得了由有限和无限词组成的模糊语言的Kleene定理。此外，我们介绍了规则模糊语法和线性模糊系统，并证明它们两者都指定了由有限和无限词组成的可识别模糊语言的类别。

著录项

来源
《Fuzzy sets and systems》 |2006年第11期|p.1532-1549|共18页
作者
Werner Kuich; George Rahonis;
展开▼
作者单位

Institut fuer Algebra und Computermathematik, Technische Universitaet Wien, Wiedner Hauptstrasse 8-10, A-1040 Wien, Austria;

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

机译：quemirings;模糊半环;模糊语言;形式系列;无限词;

相似文献

外文文献
中文文献
专利

1. LANGUAGES OF FINITE WORDS OCCURRING INFINITELY MANY TIMES IN AN INFINITE WORD [J] . KLAUS THOMSEN RAIRO Theoretical Informatics and Applications . 2005,第4期

机译：无限词中多次出现有限词的语言
2. LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES [J] . NAMIT CHATURVEDI, JORG OLSCHEWSKI, WOLFGANG THOMAS International Journal of Foundations of Computer Science . 2012,第5期

机译：常规无限游戏中的语言与ω语言的对比
3. LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES [J] . NAMIT CHATURVEDI† JÖRG OLSCHEWSKI‡ and WOLFGANG THOMAS§ International Journal of Foundations of Computer Science . 2012,第5期

机译：常规无限游戏中的语言与ω语言的对比
4. P Finite Automata and Regular Languages over Countably Infinite Alphabets [C] . Juergen Dassow, Gyoergy Vaszil Membrane computing . 2006

机译：无限无限字母上的P有限自动机和规则语言
5. The subword complexity of finite and infinite binary words. [D] . Gheorghiciuc, Irina. 2004

机译：有限和无限二进制字的子字复杂度。
6. Observations on the Words in Various Languages Answering to the English Word Liver [O] . 1811

机译：各种语言的单词对英语单词肝的回答
7. Languages of finite words occurring infinitely many times in an infinite word [O] . Thomsen Klaus 2005

机译：在一个无限词中无限次出现的有限词的语言
8. Operations on N-varieties of regular (omega)-languages and products on regular (omega)-languages [R] . Phan Trung Huy, Do Long Van 1995

机译：在常规（ω）语言上对N种常规（ω）语言和产品进行操作

Fuzzy regular languages over finite and infinite words

摘要

著录项

相似文献

相关主题

期刊订阅