查询词典 automata

The damage and failure processes of concrete materials under dynamic loading, such as impact and penetration, were researched with Movable Cellule Automata Method.

本文采用移动元胞自动机法(Movable Cellular Automata Method)研究混凝土材料在冲击、侵彻等动载荷作用下产生损伤和破坏的过程。

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自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

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定理则给出了弱可逆二次型有限自动机的充要条件及弱逆的求法。

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定理），由此我们得到了产生全体可逆二次型有限自动机的方法：要产生一个具有某种可逆性的二次型有限自动机只需产生一个具有同种可逆性的输入存储线性有限自动机，然后作其二次型提升即可。

The theory of cellular automata, proposed by the famous scientist Von Neumann in the 1950's,has developed from its original purpose of imitating the self-organization phenomenon of biological system into a widely used method.

摘要细胞自动机(Cellular Automata，简称CA)是本世纪50年代由冯·诺依曼提出的，其目的是用于模拟生物学中的自复制行为。

The theory of Cellular Automata was proposed for the discrete numerical value computations at the first. Now, the researches and applications of CA are deeper and larger.

元胞自动机(Cellular Automata，CA)理论是针对离散数值计算而提出的，目前CA研究和应用越来越深广。

This paper establishes a new one based on CA taking the NaSch model and Yuanjian's model for reference. And we name it Self-Adjusting Network Model based-on Cellular Automata, SAN-CA for short.

本文在NaSch模型和袁坚等人模型的基础上，基于CA建立了一个新的计算机网络模型：Self-Adjusting Network Model based-on Cellular Automata，简称SAN-CA。

This paper establishes a new one based on CA taking the NaSch model and Yuanjians model for reference. And we name it Self-Adjusting Network Model based-on Cellular Automata, SAN-CA for short.

本文在NaSch模型和袁坚等人模型的基础上，基于CA建立了一个新的计算机网络模型：Self-Adjusting Network Model based-on Cellular Automata，简称SAN-CA。

Seeking for regularity of the cellular automata rule space is the center issues for cellular automata theoretical research.

1引言细胞自动机(cellular automata，简记CA)以其结构简单、内涵丰富等特征成为复杂性科学研究的主要工具[1]。

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自动机的极小化问题，并给出了在有限步可实现此极小化的算法。

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.

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