查询词典 automata

According to the characteristics of elementary cellular automata, partitioned matrix is employed to define t he local rules in the form of the matrix for the elementary cellular automata.

针对初等细胞自动机的特点，使用分块矩阵对初等细胞自动机的局部规则进行了基于矩阵形式的定义。

As for a given automata,there exists three cases:for some state which did not being visited, for some state itself indeed being not reachable although it has been visited,for some state it is equivalent to other states though it can be reached to, in these three cases it is obviously redundant to construct these automata, and the only way for us is to delete,integrate and reduct these useless states in order to minimize the number of states.

对于一个给定的自动机，它的状态中有一些根本没有被访问过，有一些尽管被访问过，但是本身是不可达的，有一些状态尽管是可达的，但是在功能上却与另一些状态等价，这样的自动机在设计和应用中显然很累赘，可以将一些无用的状态删掉，将另外一些等价状态进行整合和约简，使之状态数达到极小。

To analyze the effects of heterogeneous material characteristics on rock failure,a micro-heterogeneous physical cellular automata model is introduced according to the cellular automata theory from a general power view.In this model,the neighbor is the Moore pattern and the Weibull distribution is adopted to simulate the rock heterogeneousness.

为了分析岩石材料的非均质性对其破坏演化的影响，根据元胞自动机理论，从能量的角度建立了一种能够从细观层次上对岩石破坏演化进行模拟的物理元胞自动机模型，模型引用的Weibull随机分布函数对材料的非均质性进行描述。

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型模糊有限状态自动机被建立。

Therefore,the study of the the algebraic properties of automata with truth-values in lattice-ordered monoid and the study of the minimization algorithm form two crucial subjects in fuzzy automata theory.

因此，对取值于格半群的自动机代数性质的研究和极小化问题的研究是格值自动机理论的两个重要课题。

Automata with truth-values in lattice-ordered monoid are more powerful than other kind of fuzzy automata, which-construct a new model of computing with words.

取值于格半群的自动机比其它形式的模糊自动机能接受更为广泛的形式语言与模糊语言，将基于词的计算模型建立在更广泛的理论之上。

According to the property that all states of a certain cellular automata can build a permutation group, we can design block cipher based on this property.5. One simple cellular automata and one simple linear feedback shift register have been implemented.

根据有些细胞自动机的所有状态可以构成一个循环群这一特点，指出了利用细胞自动机构造分组密码的方式。

The theory of finite automata is a branch of automata theory.

有限自动机是自动机理论的一个分支，随着数字计算机，数字通信和自动化等科学技术的出现和发展，自动机理论在理论和实践中发挥着越来越重要的作用。

The basic theory of cellular automata, the ways how algorithms are designed based on cellular automata and the security of the algorithms have been discussed in this thesis.

本文主要对细胞自动机的基本理论、利用细胞自动机构造密码的各种方式及其安全性进行了研究。

Another aspect is the emphasis on the structural theory of automata that studies ways to contstruct big automata from small ones.

另一个方面是关于从小的研究contstruct大的自动装置的方法的自动装置的结构的理论的重点

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.

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