查询词典 automata

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

Secondly, in a more generalized framestructrue--lattice-ordered monoids,the notion of lattice-valued Mealy-type automata is introduced,we traverse some algebraic properties of this automata and investigate the congruences and homomorphisms of this type automata.Our main results indicate that the algebraic properties of lattice-valued Mealy-type automata have Close links to the algebraic properties of lattice-ordered monoids which automata take values in.Futhermore we study the minimization of lattice-valued Mealy-type automata and provide an algorithm to achieve the minimal lattice-valued Mealy-type automata within finite steps.

其次，在更一般的框架—格半群意义下，提出具有输入和输出字符的自动机——格值Mealy自动机的概念，从代数角度出发较详细地研究了此类自动机具有的性质，同时研究了此类自动机的同余和同态，揭示了此类自动机的代数性质和格半群的紧密联系，最终研究了格值Mealy自动机的极小化问题，并给出了在有限步可实现此极小化的算法。

Then we found bijections between quadratic form finite automata and input memory linear automata which lead to a way to produce all weakly invertible or weak inverse quadratic form finite automata. In the last section of chapter three, we extend these results to a more general class of nonlinear finite automata (called qusi-quadratic form finite automata).

然后我们建立了建立全体二次型有限自动机与全体输入存储线性有限自动机之间的的一个一一对应L，由于L保持弱逆性（3.20定理），由此我们得到了产生全体可逆二次型有限自动机的方法：要产生一个具有某种可逆性的二次型有限自动机只需产生一个具有同种可逆性的输入存储线性有限自动机，然后作其二次型提升即可。

In chapter three, we first give the definition of quadratic automata (3. 6 definition), then study their invertibility. 3. 10 theorem gives a sufficient and necessary conditions for weak inverse quadratic form finite automata, and a way to find the one whose weak inverse is quadratic form finite automata.

第三章首先构造了二次型有限自动机类（3.6定义），研究其上的可逆性理论。3.10定理给出了弱逆二次型有限自动机的充要条件及弱原逆的求法、3.12定理则给出了弱可逆二次型有限自动机的充要条件及弱逆的求法。

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.

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

More direct, directer ; most direct, directest

径直的，笔直的

Do you know how to use a chain saw?

你知道如何使用链锯吗？