Animals like birds were viewed as lovely automata capable only of stereotyped activity.
像鸟类这样的动物被看成是只能作出套路动作的自动机械。
In this paper, these features of cellular automata have been well embodied and exerted.
本文中元胞自动机的这些特点得到了很好的体现和发挥。
GRAFCET is a programming language dedicated to industrial automata (Arzul gives details in his post).
GRAFCET是工业自动机的专用编程语言(Arzul在他的帖子中给出了细节)。
For example, the XAUST XML compressor converts the schema information of the DTD into a set of deterministic finite automata (DFA), one for each element in the DTD.
例如，XAUSTXML压缩器将DTD的模式信息转换成一组确定性有限自动机(DFA)，每个DFA对应于DTD中的一个元素。
Later editions of the classic sci-fi fable postponed the setting to 2021—largely because, in the real world, so little actual progress had been made in human-like automata.
这个经典科幻寓言之后发行的版本将故事发生时间推迟到了2021年，这主要是因为，这些年来，现实世界中，类人自动化机器的实质进展微乎其微。
It aims to analyze and synthesize automata.
它旨在研究自动机的分析与综合问题。
The characteristics and theory of lattice gas automata have been introduced.
介绍格子气自动机方法的原理与特点。
We formulate, in this paper, algorithms for boundary tracing based on automata.
本文中我们用自动机的方法表示了边界跟踪算法。
These new kind of automata were developed to meet the needs of society in Japan.
日本研发出的这些新型机器人主要是为了适应社会的需要。
Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直觉模糊自动机理论是自动机理论的一个重要分支。
In this paper, a new tree automata based machine, XEBT, is proposed to solve the problem.
提出了基于树自动机的XEBT机来解决这个问题。
Propese a real-time workflow time modeling and verification method based on timed automata.
提出一种基于时间自动机的实时工作流时间建模与验证方法。
This paper characterizes symmetric ternary cellular automata (CA -3) with the help of matrix algebra.
本文提出对称三值系统中的元胞自动机(CA -3)的特征化表示方法。
The systems are usually described by the timed automata and the properties are specified by the temporal logic.
这类系统通常用时间自动机来表示，而它们的性质则用时序逻辑公式表示。
This paper surveys interface automata, timed interface automata, resource interface and game-based idea in them.
本文对接口自动机、时间接口自动机和资源接口及其中的博弈思想进行综述。
Experimental results show this automata model can simulate the transmission process of virus in complex networks well.
实验结果表明，该自动机模型能较好地模拟复杂网络中病毒的传播过程。
The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
To meet the need of Chinese information processing, the traditional finite automata is transformed to the reversed finite automata.
根据中文信息处理的需要，把传统的有限自动机改造成了反向有限自动机。
Based on the theory of complexity adaptive system, we build a cellular automata model to simulate the complex process of epidemic spread.
从复杂适应系统的观点，通过建立元胞自动机模型的方法模拟疾病传播这个复杂的过程。
Proposed an one-dimensional sandpile model which include avalanche probability, and performed computer simulation by cellular automata method.
提出了一个含崩塌概率的一维沙堆模型，并用元胞自动机方法对该模型进行计算机模拟。
The applications of cellular automata method in materials design including recrystallization and solidification phase changes have been reviewed.
综述了元胞自动机方法在材料设计中的应用，包括再结晶方面和相变方面。
The cellular automata simulation method was widely used in engineering areas because of its simple structure and adapted to parallel calculating.
元胞自动机模拟方法由于其结构简单、易于并行运算而在工程领域有着广泛的应用。
Especially, as opposed to the traditional automata, the limiting behavior of the proposed algorithm possesses both absorbing barriers and ergodicity.
特别，跟传统自动机不同的是，新算法的极限行为同时兼具吸收壁和遍历性。
A necessary condition of Devaney's chaos for cellular automata (CA) is found, then an algorithm is presented to verify which CA satisfy this condition.
提出了元胞自动机混沌的一个必要条件，给出了判断初等元胞自动机是否满足这一条件的算法。
In this paper we made a survey of cellular automata (ca) traffic models which can be classified into single-lane, (multi-lane) and city traffic models.
对基于元胞自动机的交通模型进行综述，将其分为单车道模型、多车道模型和城市交通模型三类。
The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。
In this paper, we research region automata, zone automata and the method of state space minimization based on history equivalence and bisimulation transition.
本文主要研究了域自动机方法、带自动机方法以及基于历史等价和转换互模拟的最小化方法。
In this paper, we research region automata, zone automata and the method of state space minimization based on history equivalence and bisimulation transition.
本文主要研究了域自动机方法、带自动机方法以及基于历史等价和转换互模拟的最小化方法。
应用推荐