共查询到18条相似文献,搜索用时 265 毫秒
1.
2.
模糊自动机的强连通性及群自动机 总被引:1,自引:0,他引:1
为了更好地研究模糊自动机的结构和性质,采用代数的方法,在传统的模糊有限状态自动机的基础上,通过定义状态集合为代数群的自动机,讨论了这一类自动机的连通性和正则性,这丰富了模糊自动机理论. 相似文献
3.
4.
5.
6.
7.
在矩阵理论框架下,引入了模糊有限自动机转移矩阵,变换矩阵半群以及覆盖概念.定义了模糊有限自动机Kronecker积,讨论了其转移矩阵性质及变换矩阵半群间的覆盖关系. 相似文献
8.
9.
到目前为止,我们所研究的模糊或非模糊的自动机都是有限状态自动机.然而,关于无限状态自动机的定义及它的稳定性和收敛性都没有被讨论过.本文中,我们使用离散的反馈神经网络及网络输出空间划分方法,同时,在梯度更新算法中使用伪梯度方法,给出了模糊无限状态自动机收敛到模糊有限状态自动机的证明. 相似文献
10.
经过重新定义模糊自动机,使得模糊自动机的识别过程与一个合成模糊变换(CF变换)一致,而且得到了尊重合成模糊变换的最粗分类即为状态集的最粗等价分类这一重要结论.在对尊重合成模糊变换的最粗分类的讨论中,给出了找到尊重合成模糊变换的最粗分类的有限步算法,亦即状态集的最粗等价分类和最小化模糊自动机的算法.该算法不仅给出了最长运算时间,而且还给出可终止算法的条件,使得运算更为可行和简便. 相似文献
11.
Clifford A. Reiter 《Complexity》2002,7(3):19-29
Boolean cellular automata may be generalized to fuzzy automata in a consistent manner. Several fuzzy logics are used to create 1‐dimensional automata and also 2‐dimensional automata that generalize the game of life. These generalized automata are investigated and compared to their Boolean counterparts empirically and using rule entropy and repeated input response functions. Fuzzy automata offer new mechanisms for classification of classical automata and can be used for insight into their qualitative behavior. © 2002 Wiley Periodicals, Inc. 相似文献
12.
以往对演化博弈的研究都假设个体从博弈中获得的支付是确定的并以精确的数来表示。然而由于受环境中各种不确定因素的影响,个体博弈时所获得的支付并不是一个精确的数值,而需要用一个模糊数来表示。本文研究模糊支付下2×2的对称博弈, 利用模糊数的运算, 分析具有模糊支付的有限种群Moran过程演化动态。在弱选择下以梯形模糊数和三角模糊数表示博弈支付,计算策略的模糊扎根概率,分析自然选择有利于策略扎根及策略成为模糊演化稳定策略的条件。将经典博弈推广到模糊环境中丰富了演化博弈理论,更具有现实意义。 相似文献
13.
14.
15.
Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations. 相似文献
16.
将凸合成模糊对策的特征函数用三角模糊数的形式表示出来,并以三角模糊数表示局中人的参与度,从而建立了一个新的凸合成模糊合作对策的模型.在此模型的基础上,给出了凸合成模糊对策的三角核心和三角稳定集,并证明了上述解可由子对策的核心和稳定集表达出来. 相似文献
17.
The natural language computing today demands for the study of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, the concept of fuzzy local ω-language, Büchi fuzzy local ω-language, and some closure properties of fuzzy local ω-languages are presented. We introduce deterministic fuzzy finite automaton with different acceptance mode on fuzzy ω-languages and establish the relationship between these various classes of fuzzy ω-languages. We have defined deterministic fuzzy local automaton and also establish relationships between deterministic fuzzy local automaton, fuzzy local ω-language and Büchi fuzzy local ω-language. Further we show that every fuzzy regular ω-language is a projection of a Büchi fuzzy local ω-language. 相似文献
18.
Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata A and B is a forward bisimulation if and only if its kernel and co-kernel are forward bisimulation fuzzy equivalence relations on A and B and there is a special isomorphism between factor fuzzy automata with respect to these fuzzy equivalence relations. As a consequence we get that fuzzy automata A and B are UFB-equivalent, i.e., there is a uniform forward bisimulation between them, if and only if there is a special isomorphism between the factor fuzzy automata of A and B with respect to their greatest forward bisimulation fuzzy equivalence relations. This result reduces the problem of testing UFB-equivalence to the problem of testing isomorphism of fuzzy automata, which is closely related to the well-known graph isomorphism problem. We prove some similar results for backward-forward bisimulations, and we point to fundamental differences. Because of the duality with the studied concepts, backward and forward-backward bisimulations are not considered separately. Finally, we give a comprehensive overview of various concepts on deterministic, nondeterministic, fuzzy, and weighted automata, which are related to bisimulations. 相似文献