模糊有限状态自动机 meaning in Chinese
fuzzy finite state automaton
Examples
- In chapter 2 , a class of fuzzy finite automata corresponding to the mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced
在第二章中，对应于经典mealy型有限状态自动机的一类模糊有限状态自动机-新mealy型模糊有限状态自动机被建立。 - As a special case of lattice - valued finite state automata , mizumoto fuzzy finite state automaton is considred . furthermore , we obtain a minimization algorithm of mizumoto fuzzy automata . we obtain our results mainly by compare and contrast , analysis and synthesis , induction and reduction to absurdity
此外,本文对格值有限状态自动机的一种特殊类型? ? mizumoto型模糊有限状态自动机的状态最小化约简问题也作了一些探讨,给出了mizumoto型模糊有限状态自动机的一种状态最小化约简算法。 - This algorithm recovers the absence of the empiric in the case of the fixed - topology network and generates an optimal topology automatically . we end this chapter with some problems in the future . in chapter 2 , we present an evolution strategy to infer fuzzy finite - state automaton , the fitness function of a generated automaton with respect to the set of examples of a fuzzy language , the representation of the transition and the output of the automaton and the simple mutation operators that work on these representations are given
目前，国内外对神经网络与自动机的结合的研究己取得了一系列成果；在第一章，我们首先将对这些结果以及这个领域的研究思想与方法做一个概要的介绍；然后提出一种推导模糊有限状态自动机的构造性算法，解决了仿真实验中所给出的具体网络的隐藏层神经元个数的确定问题；在实验中，我们首先将样本输入带1个隐藏层神经元的反馈网络训练， 150个纪元以后增加神经元，此时的新网络在124纪元时收敛；而blanco [ 3 ]的固定性网络学习好相同的样本需要432个纪元。