arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.01994eess.SYcs.SY
收藏

综合模糊图灵机--有限状态机控制概念的一种演变

Comprehensive Fuzzy Turing Machines, An Evolution to the Concept of Finite State Machine Control

Najmeh Ahang, Amin Torabi Jahromi, Mansour Doostfatemeh

摘要:

图灵机是一个抽象概念的计算设备,它引入了新的计算模型。Zadeh和Lee定义的模糊算法的思想被引入模糊图灵机(FTM),为新的模糊计算模型创建了一个平台。然后,在他对计算能力的研究中,Wiedermann表明FTM能够解决不可判定的问题。他提出的FTM结构与原定义非常相似,是最近最著名的FTM经典定义之一,为了改进它的一些弱点和模糊点,本文将广泛讨论,我们将发展一个更完整的模糊图灵机定义。我们提出的FTM的定义,其中包括传统的定义,是从Doostfatemeh和Kremer介绍的一般模糊自动机(GFA)的定义的动机。由于它改进了模糊自动机的传统定义,特别是隶属度分配和多隶属度分解问题,我们也通过定义综合模糊图灵机(CFTM)改进了FTM的相同方面。此外,我们还讨论了FTM中一些可能的不确定性,这些不确定性在模糊自动机中并不是重点研究的对象。作为例子,我们研究的问题,多路径和多方向,这是可能的情况下的非确定性。最后,我们通过一个解释性的例子,CFTM的简单性,适用性和计算效率。

英文摘要:

The Turing machine is an abstract concept of a computing device which introduced new models for computation. The idea of Fuzzy algorithms defined by Zadeh and Lee was followed by introducing Fuzzy Turing Machine (FTM) to create a platform for a new fuzzy computation model. Then, in his investigations on its computational power, Wiedermann showed that FTM is able to solve undecidable problems. His suggested FTM structure, which highly resembles the original definition was one of the most well-known classical definitions of FTM lately.To improve some of its weaknesses and vague points which will be discussed extensively in this paper, we will develop a more complete definition for fuzzy Turing machines. Our proposed definition of FTM, which encompasses the conventional definition, is motivated from the definition of General Fuzzy Automata (GFA) introduced by Doostfatemeh and Kremer. As it improved the conventional definition of fuzzy automata, especially the problem of membership assignment and multi-membership resolution, we also improved the same aspects of FTM through the definition of Comprehensive Fuzzy Turing Machine (CFTM). In addition, we address on some possible vaguenesses in FTM was not the subject of focus in fuzzy automata. As example, we investigate the issue of multi-path and multi-direction which are possible in case of nondeterminism. Finally, we show the simplicity, applicability and computational efficiency of the CFTM through an explanatory example.

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

↑