automata

In language theory , the simplest algorithms are those which can be implemented by finite automata, the subject of this book.

在语言理论，最简单的一类算法就是可以用有限自动机实现的算法，也是本书的主题。

Inorder to begin to answer the central question of automata theory, it is necessary to define in a formal way what an automaton is.

为了开始回答的核心问题的自动机理论，有必要确定一个正式的方式在一个自动机是什么。

According to the theory of Cellular Automata, we built an improved traffic-flow model, and gave the evolving rules of every vehicle.

根据元胞自动机理论建立改进的交通流模型，给出每辆车的演化规则。

The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.

有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。

As a branch of artificial intelligence, cellular automata can be used to model and simulate the complex systems and artificial life systems.

而细胞自动机作为人工智能的一个分支学科，可以用于复杂系统和人工生命系统的建模思想。

Since the simplicity of component unit in cellular automata, it has a unique advantage in the password field.

由于元胞自动机有组成单元的简单性，使得它在密码学领域有着独特的优势。

One of us (Macdonald) led the project and trained several high school students to test automata , mostly during summers and on Saturdays.

这个计画由麦当诺领导，他培训了许多高中生来测试，大多是利用暑假和星期六来工读。

For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。

Use pigeon- holing arguments and closure properties to prove particular problems cannot be solved by finite automata .

运用鸽洞理论以及终止属性来证明某些特殊无法用有限自动机解决的问题…

We have demonstrated some of the abilities of our DNA gates by building automata that play perfect games of tic-tac-toe.

我们设计出了一个擅长玩井字游戏的自动机来展示DNA逻辑闸的一些能力。

Cellular automata(CA) is of discrete dynamical systems within various dynamical behaviors including complex dynamics.

元胞自动机是一种行为复杂的时空离散的动力系统。

As with all elementary cellular automata, its definition, illustrated in Figure 4, is quite simple -- a small diagram defines it completely.

像所有初级细胞自动机一样，它的定义——如图4所示——是相当简单的：一个小图就可以完全定义它。

RBC system for the five process timed automata model, as well as other external devices timed automata model are established in the UPPAAL.

对RBC系统的五个流程以及其他外部设备分别在UPPAAL中建立了时间自动机模型。

Introduces the notion of Finite Precision Timed Automata(FPTA) and focuses on the representation of clocks in a state.

简要介绍了有限精度时间自动机（FPTA）的基本概念，重点讨论FPTA状态中时钟的表示。

Using DCM as a data structure for the reachability analysis algorithm for multirate automata, the complexity can considerably be decreased.

理论上证得，DCM可以大大降低可达性分析算法的复杂度。

Intuitionistic fuzzy finite automata theory is an important part of automata theory.

直觉模糊自动机理论是自动机理论的一个重要分支。

Developed from Lattice Gas Cellular Automata (LGCA), Lattice-Boltzmann method is a special discrete scheme of Boltzmann equation.

格子-Boltzmann方法是Boltzmann方程的一个特殊的离散格式，它的前身是格子气自动机。

Unfortunately, automata theory tells us that no tool could ever statically determine which programs will throw null-pointer exceptions.

不幸的是，自动控制理论告诉我们，没有工具可以静态地决定哪些程序将抛出空指针异常。

The characteristics and theory of lattice gas automata have been introduced.

介绍格子气自动机方法的原理与特点。

Scanner automata, design of algorithm translation to generate TOKEN, keyword, industry at table, symbol table, constant table.

扫描器的自动机，设计翻译生成TOKEN的算法，关键字，界符表，符号表，常数表。