arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0604070cs.AI
收藏

用词计算的收缩与广义扩展

Retraction and Generalized Extension of Computing with Words

Yongzhi Cao, Mingsheng Ying, Guoqing Chen

摘要:

模糊自动机是一种形式化的数值计算模型,其输入字母表是一组数字或符号。受Zadeh的用词而不是数字计算的范式的启发,Ying提出了一种模糊自动机,其输入字母表由一组符号的所有模糊子集组成,作为用所有词计算的形式模型。在本文中,我们介绍了一个有一定普遍性的形式化模型计算(一些特殊的)字。该模型的新特点是输入字母表只包括一组符号的一些(不一定是所有)模糊子集,模糊转移函数可以任意指定。利用模糊控制的方法,我们建立了一个收缩原则,从计算的字与值处理清晰的输入和广义扩展原则,从计算的字与所有的字处理模糊输入的计算。这些原理表明,用词计算可以分别实现用值计算和用所有词计算。一些代数性质的收缩和广义扩张的处理以及。

英文摘要:

Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a formal model of computing with values. Motivated by Zadeh's paradigm of computing with words rather than numbers, Ying proposed a kind of fuzzy automata, whose input alphabet consists of all fuzzy subsets of a set of symbols, as a formal model of computing with all words. In this paper, we introduce a somewhat general formal model of computing with (some special) words. The new features of the model are that the input alphabet only comprises some (not necessarily all) fuzzy subsets of a set of symbols and the fuzzy transition function can be specified arbitrarily. By employing the methodology of fuzzy control, we establish a retraction principle from computing with words to computing with values for handling crisp inputs and a generalized extension principle from computing with words to computing with all words for handling fuzzy inputs. These principles show that computing with values and computing with all words can be respectively implemented by computing with words. Some algebraic properties of retractions and generalized extensions are addressed as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑