automata

美 [ɔˈtɑmətən]英 [ɔːˈtɒmətən]
  • n.自动物;自动玩具;自动开关;自动装置
  • 网络自动机;自动人偶;自动之物

复数:automatons 复数:automata

automataautomata

automata

自动机

动画概论_百度百科 ... 4.3 细节完善( FinalDetails) 5.1 自动机( Automata) 5.2 运动研究( MotionStudies) ...

自动装置

心理学专业词汇翻译辞典 - MBA智库文档 ... autolesion 自伤 automata 自动装置 automated factory 自动化工厂 ...

自动人偶

自动人偶Automata)…?不,即使如此这也太…怎么说呢,这难道…这难道就是,传闻中的日本技术品(Art)… ■机器翡翠 …

自动之物

照他说,动物只是机器、只是自动之物(automata)。疼痛、快意、任何感觉,它们都感受不到。

自动玩偶

自动玩偶Automata)”是指在欧洲八音盒中活动的玩偶。自动玩偶总给人一种木然冷淡的印象,而日本的活动玩偶却不同, …

自动机械结构

...l Animal);另一个类比是将人造动物拓展到“自动机械结构”(Automata)上,即创造者还可以赋予机械物(如钟表)以人造 …

机械手

英语中不规则名词变复... ... * apex → apices,apexes 顶点 * automaton → automata 机器人, 机械手 * axis → axes 轴线, 中心线 ...

1
In language theory , the simplest algorithms are those which can be implemented by finite automata, the subject of this book. 在语言理论,最简单的一类算法就是可以用有限自动机实现的算法,也是本书的主题。
2
Inorder to begin to answer the central question of automata theory, it is necessary to define in a formal way what an automaton is. 为了开始回答的核心问题的自动机理论,有必要确定一个正式的方式在一个自动机是什么。
3
According to the theory of Cellular Automata, we built an improved traffic-flow model, and gave the evolving rules of every vehicle. 根据元胞自动机理论建立改进的交通流模型,给出每辆车的演化规则。
4
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science. 有限自动机理论是一类简单类算法的数学理论,这些算法理论这些数学虽然简单但对计算机科学很重要。
5
As a branch of artificial intelligence, cellular automata can be used to model and simulate the complex systems and artificial life systems. 而细胞自动机作为人工智能的一个分支学科,可以用于复杂系统和人工生命系统的建模思想。
6
Since the simplicity of component unit in cellular automata, it has a unique advantage in the password field. 由于元胞自动机有组成单元的简单性,使得它在密码学领域有着独特的优势。
7
One of us (Macdonald) led the project and trained several high school students to test automata , mostly during summers and on Saturdays. 这个计画由麦当诺领导,他培训了许多高中生来测试,大多是利用暑假和星期六来工读。
8
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered. 高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。
9
Use pigeon- holing arguments and closure properties to prove particular problems cannot be solved by finite automata . 运用鸽洞理论以及终止属性来证明某些特殊无法用有限自动机解决的问题…
10
We have demonstrated some of the abilities of our DNA gates by building automata that play perfect games of tic-tac-toe. 我们设计出了一个擅长玩井字游戏的自动机来展示DNA逻辑闸的一些能力。
11
Cellular automata(CA) is of discrete dynamical systems within various dynamical behaviors including complex dynamics. 元胞自动机是一种行为复杂的时空离散的动力系统。
12
As with all elementary cellular automata, its definition, illustrated in Figure 4, is quite simple -- a small diagram defines it completely. 像所有初级细胞自动机一样,它的定义——如图4所示——是相当简单的:一个小图就可以完全定义它。
13
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中建立了时间自动机模型。
14
Introduces the notion of Finite Precision Timed Automata(FPTA) and focuses on the representation of clocks in a state. 简要介绍了有限精度时间自动机(FPTA)的基本概念,重点讨论FPTA状态中时钟的表示。
15
Using DCM as a data structure for the reachability analysis algorithm for multirate automata, the complexity can considerably be decreased. 理论上证得,DCM可以大大降低可达性分析算法的复杂度。
16
Intuitionistic fuzzy finite automata theory is an important part of automata theory. 直觉模糊自动机理论是自动机理论的一个重要分支。
17
Developed from Lattice Gas Cellular Automata (LGCA), Lattice-Boltzmann method is a special discrete scheme of Boltzmann equation. 格子-Boltzmann方法是Boltzmann方程的一个特殊的离散格式,它的前身是格子气自动机。
18
Unfortunately, automata theory tells us that no tool could ever statically determine which programs will throw null-pointer exceptions. 不幸的是,自动控制理论告诉我们,没有工具可以静态地决定哪些程序将抛出空指针异常。
19
The characteristics and theory of lattice gas automata have been introduced. 介绍格子气自动机方法的原理与特点。
20
Scanner automata, design of algorithm translation to generate TOKEN, keyword, industry at table, symbol table, constant table. 扫描器的自动机,设计翻译生成TOKEN的算法,关键字,界符表,符号表,常数表。
21
An orthogonal design and cellular automata based acceleration parallel genetic algorithm (APGA) is presented. 为此,结合正交试验设计和元胞自动机模型,提出了一种改进的加速并行遗传算法(APGA)。
22
Cellular automata are used to bridge the gap between the micro level and the macro level. 用元胞自动机作为宏观分析与微观仿真之间的桥梁。
23
An automata network model is a powerful modeling tool in complex systems. The key character of the method is a bottom-to-up way. 自动机网络方法采用自底向上建模的解题思路,是复杂系统有效的建模分析工具。
24
By studying elementary cellular automata, Wolfram found that complex behavior could arise from simple mechanisms. 通过研究初级细胞自动机,Wolfram发现简单的机制可以产生出复杂的行为。
25
We can use Cellular Automata modeling diffusion of two different matters and establish sample of evolution law of diffusions. . . 用元胞自动机模拟两种物质的扩散过程,建立扩散系统的演化规则样本。
26
Cellular Automata is a kind of dynamic model whose time, space and state are discrete and a method of studying nonlinear science. 元胞自动机是一种时间、空间、状态都离散的动力学模型,是非线性科学的一种重要的研究方法。
27
In this course we concentrate on languages (e. g. sets of words) described by finite automata, context-free grammars and Turing machines. 在这本书中我们集中讲述由有限自动机、上下文无关文法和图灵机所描述的“语言”(单词的集合)。
28
Finite Automata, Regular Languages, Regular Expressions. 有限自动机,正规语言,正规表示式。
29
In this paper the SEIRS epidemic spread is analysed, and a two-dimensional probability cellular automata model for SEIRS is presented. 本文通过分析SEIRS类流行病,建立了该类疾病的二维概率细胞自动机模型。
30
Until now, a large number of cryptosystems based on chaos and cellular automata have been proposed and systematically analyzed. 目前,已提出了大量基于混沌和细胞自动机的密码设计方案,并进行了系统的分析。