查询词典 automata

Now that the L-valued fuzzy state automata has such powerful computation capacity, it is necessary to traverse the algebraic properties such as transformation semigroups,products and covering relations in L-valued fuzzy automata in order to show the close correspondence between the algebraic properties and the latticeordered monoid.

既然格值自动机具有如此强大的计算能力，有必要对其从代数角度出发较详细地，较深入地研究此类自动机的变换半群，乘积和覆盖关系，揭示此类自动机的代数性质和格半群间的紧密联系。

A translation method from two-way alternating automata to nondeterministic automata is also provided.

并且给出了将双向交换自动机转化为非确定自动机的一种方法。

This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.

本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。

This paper also gives significances of interface automata in theory and in practice, and the future of the application of interface automata.

文中总结了接口自动机在理论上和实际中的意义并对其应用前景做了展望。

Establish integrated invertibility theory over it: By R〓R〓 transformation method, we solve the problem of deciding weakly invertibility and finding weak inverse, By founding the bijections between all quadratic form automata and input memory linear finite automata, we find a algorithm to produce all weak inverse quadratic form finite automata.

本文着眼于这些最基本问题，将有限域上的二次型和置换多项式理论引入有限自动机可逆性的研究，构造了一类由二次型构成的非线性有限自动机（3.6定义），称之为二次型有限自动机，我们在其上面建立了与线性有限自动机可逆性理论相对应的完整的可逆性理论：采用线性R〓R〓变换方法，解决了此类有限自动机的弱可逆性判定、求弱逆问题（3.10、3.12定理）、通过建立全体二次型有限自动机与全体输入存储线性有限自动机之间的保持弱逆性的一一对应，给出了产生全部可逆二次型有限自动机的方法。

In this project, we investigate the invertibility problem of finite automata, cryptosystems based on finite automata theory and security protocols. Some applications of the finite automata public key cryptosystem to internet are explored.

本项目研究有限自动机可逆性问题和基于自动机理论的密码算法与安全协议，探讨有限自动机公开钥密码在因特网环境的应用。

This paper studies the properities of weakly invertible Linear finite automata through zero state,and obtains some results of weakly invertibility of Linear finite automata and description of the minimal linear finite sub-automata.

通过零状态研究了线性有限自动机的一些性质，得到了线性有限自动机弱可逆的一些结果，并给出了最小线性子有限自动机的描述，最后给出了算法实现。

This paper studies on weak invertibility of a linear finite automata based on its matrix model,gets a full and essential condition on which a linear finite automata weakly and invertibly delays finite steps,and also gives an algorithm whether or not a linear finite automata has weak invertibility .

主要讨论了基于矩阵模型表示的线性有限自动机的弱可逆性，利用矩阵模型得出了线性有限自动机延迟有限步弱可逆的充分必要条件，并且给出了线性有限自动机是否具有弱可逆的算法。

Cellular Automata in the development process of the "Game of Life" is a typical model of cellular automata theory research has played a significant role in promoting, which is considered the development of cellular automata as a milestone in the history of.

在元胞自动机的发展过程中，"生命游戏"这个典型模型对元胞自动机的理论方法的研究起到了极大的推动作用，它被认为是元胞自动机发展历程中的一个里程碑。

Otherwise, this paper also discusses the theory of cellular automata itself, tries to put fuzzy logic into the cellular automata, and gives the definition of fuzzy cellular automata.

另外，本文也对模糊元胞自动机理论本身进行了探讨，尝试着将模糊逻辑引入到元胞自动机模型中，定义了模糊元胞自动机。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。