automata

automata

1. Was graduated from Tsinghua university automata to fasten an aircraft to control major 1968.

1968年毕业于清华大学自动控制系飞行器控制专业。

2. Finite automata representations of XML, XML Schema and path expression and the correlation relationship between XML NFA and Schema DFA.

2)以有限自动机为工具,给出了XML,XML Schema,路径表达式的自动机表示形式,以及它们之间的关系。

3. Cellular automata were invented in the 1940s by John von Neumann and Stanislaw Ulam at Los Alamos National Laboratory.

20世纪40年代冯?诺伊曼与乌拉姆在洛塞勒摩斯国家实验室发明细胞自动机。

4. The NFA (Non-deterministic Finite Automaton) model of GECISM accurately describes this system and meanwhile is the basement of performance analysis and system test about GECISM.

GECISM的NFA(Non-deterministic Finite Automaton )模型精确定义了GECISM的属性和特征,为GECISM的性能分析、系统测试提供了理论 基础。

5. Petri Net, Finite State Automata (FSA), IDEF3 and State Charts are traditionally used for behavior modeling.

Petri Net、有限自动机、IDEF3和状态图是常用的行为建模方法。

6. The design and implementation of XSIEQ are presented. XSIEQ uses a modified pushdown automata technique,and its idea is to convert all XPath expressions into a single NFA,then to attach type label and corresponding index info on NFA state.

XSIEQ采用修改了的下推自动机技术,对多个XPath式按前缀共享的方式构造NFA,并对NFA状态进行类型标记和添加索引;

7. The first step constructs an NFA (Nondeterministic Finite Automaton) equivalent to the regular expression, where the operation for constructing finite automata with e -moves is omitted.

万法是首先构造与正则表达式等价的非确定有限自动机(NFA)，这里省略了构造带。

8. To understand thermal properties in lattice gas automata, a twelve bit multispeed model on hexagonal lattice is used to simulate rest flow and Couette flow.

为了理解格子气自动机的热性质,本文用12bit六方格子多重速度模型模拟了静止流和Couette流的流场分布和温度分布。

9. An orthogonal design and cellular automata based acceleration parallel genetic algorithm (APGA) is presented.

为此,结合正交试验设计和元胞自动机模型,提出了一种改进的加速并行遗传算法(APGA)。

10. A modified three-dimensional cellular automaton (CA) model was developed to predict the formation and evolution of mesoscopic structures in alloys.

为预测合金介观组织的形成与演变,提出了改进的三维元胞自动机(CA)模型。

11. It includes topics such as artificial life, cellular automata, chaos, criticality, evolutionary computation, fractals, parallel computation, self-organization.

主题包括：人工生命、细胞自动控制、混沌、临界性、演化计算、分形、并行计算以及自花授精。）

12. Based on the assumption that congestion events consist of a renewal process sequence, the TCP AIMD congestion control is modeled as one-state stochastic hybrid automaton.

互联网中的拥塞控制是一个离散事件与连续变量相互作用的混杂动态过程. 假定拥塞事件为一个更新过程序列,采用含有一个状态的随机混杂自动机模型,描述了TCP拥塞控制中的AIMD过程.

13. Man like every other animal is by nature indolent. If nothing spurs him on, then he will hardly think, and will bahave from habit like an automaton.

人如其他动物一样本性慵懒，如果没有什么鞭策着他，他几乎不思考，只是象机器人一样按照习惯去做。

14. An automaton that is created from biological materials and resembles a human being.

人形自动机用生物材料做成的类似人形的机器人

15. Man like every other animal is by nature indolent,if nothing spurs him on,then he will hardly think,and will behave from habit like an automaton.

人类就像动物一样生性懒惰，如果没有任何事物去鞭策他，那他将不去思考，他的行为就像机器人。

16. In spite of our warnings he plowed ahead with the involuntariness of an automaton.

他不顾我们的警告，以机器人似的无意识状态一往直前。

17. Based on the cellular automata theory,a new method of designing irregular weave by computer is introduced.

以细胞自动机理论为基础,提出了不规则组织计算机辅助设计的新思路。

18. Zhongya Automata Welding Equipment Co., Ltd.

任丘市中亚自动焊接设备有限公司。

19. But in the cursed babel of man-things, it has many designations: automata, robot, golem, droid, homunculus, simulacra.

但是，出于人形物的巴别塔（通天塔）诅咒[1]，这个东西有了各种称号：自动机、机器人、傀儡（魔像）、德劳特（droid人形机器人）、矮人、拟像。

20. In this paper,it is mainly discussed a finite-state deterministic fuzzy automaton(FDA),which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata.

作者讨论了有限态确定模糊自动机FDA与它相应的模糊语言以及FDA与其它自动机的等价性。

21. Key words: household appliance; remote control; home automaton; telephone network; ring-detecting.

关键词：家用电器；远程控制；家庭自动化；电话网络；振铃检测

22. Secondly, domino model, pyramid model, reverse pyramid model, and cellular automaton model have been presented in order to explain the concepts of brittleness clearly.

其次，为了形象化说明复杂系统脆性的概念，提出了多米诺骨牌模型、金字塔与倒金字塔模型、元胞自动机模型等几种基本模型。

23. Among our tests was an omission experiment, in which the automaton's operation was evaluated with one molecular component removed at a time.

删除实验是我们进行的其中一个测试：一次移除一种分子组成，然后评估自动机的表现。

24. Using the interaction between cellular automata, a cryptography system based on the coupled toggle cellular automata is proposed to enlarge the key space and the strength of the system.

利用元胞自动机之间的相互作用，提出耦合触发元胞自动机的加密技术，增加密钥空间和增强密码系统的强度。

25. The system uses circular links to allot IP addresses and ports, with double hashing and session timers with improved state automata to look up mapping items.

利用循环链表分配地址和端口,利用双散列和优化的定时器机制相结合实现映射表项的维护和查找。

26. According to clock zone, infinite state space of timed automata can be transformed to finite.

利用时钟带，可以将时间自动机的无穷状态空间转化为有穷。

27. The highway toll collector system was researched by using the finite automata theory.

利用有穷自动机理论研究了高速公路收费站的收费系统。

28. A cellular automaton model was developed to simulate the primary spacing selection of dendritic array during directional solidification.

发展了一个元胞自动机模型来模拟定向凝固中枝晶阵列的一次间距选择。

29. To turn into an automaton.

变为自动装置

30. Another formalism mathematically equivalent to regular expressions, Finite automata are used in circuit design and in some kinds of problem-solving.

另一数学形式等价于正则表达式，有限的自动控制用于循环设计和一些问题的的解决。

31. To predict land use change, Cellular Automaton was adopted and the possible integration of CA and Temporal GIS was discussed.

另外，初步探讨了基于时态的土地利用缓冲区分析，考察交通干线、枢纽等对土地利用的影响。

32. Naming will be handled in the same way that dragoons and puppetmasters select their wyvern or automaton’s name, but there will be more options than ever before!

名字的选取跟龙骑士和宠物师的宠物一样，由系统选取，不过将会有更多的选择。

33. Removing irrelevant atomic formulas for checking timed automata efficiently. In Proc.

因此,无关的原子约束是广泛存在的。

34. The open-boundary Cellular Automata traffic flow model in accordance withthe practice was raised and simulated numerically on the basis of BML model.

在BMI模型的基础上，提出了符合实际情况的开放边界交通流模型并对其进行了数值模拟分析。

35. Writing in the science journal Nature,Shapiro and his team describe their DNA computer the automaton which can answer certain yes or no questions.

在《自然》科学杂志刊登的一篇文章里，沙皮罗和研究小组成员把DNA计算机视为能准确判断是非的自动装置。

36. With respect to the function,regular grammar is equivalent to finite automata in accepting languages.There exist some equivalent construction algorithms,which are rather complex.

在功能上,正规文法与有限自动机描述和识别语言是等价的,它们之间也存在等价构造算法,但这些构造算法有些复杂。

37. In trying a variety of programs with our simple molecular automaton, we also found a way of further improving its performance.

在尝试利用简单的分子自动机来执行各种不同程式的过程中，我们也发现了改良自动机表现的方法。

38. Considered the existing situation, a new algorithm for edge detection of image based on cellular Automata is proposed.

在已有的基于元胞自动机的图像处理算法基础上,结合元胞自动机和图像边缘的种种特征,提出了一种新的适用于图像边缘检测的元胞自动机模型。

39. Based on the definitions of bifuzzy successor and bifuzzy source operators of fuzzy finite automata in [1],in this paper,we study their basic properties and their essential relationships. Finally,several important results are obtained.

在文[1]定义了模糊有限自动机的bifuzzy seccessor算子和bifuzzy source算子的基础上,着重研究它们之间的基本性质及关系,并得到几个重要的性质定理。

40. The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem.

在有限自动机公开钥密码体制中首次提出了自动机化合的概念.

41. Based on lattice monid, a new type of computational models called Pushdown Lattice-valued Automata is introduced whose inputs are strings of fuzzy subsets of the input alphabet and that corresponds with nature language.

在格半群意义下,提出基于词计算的下推格值自动机模型,它的输入是输入字母表的模糊子集,即词串,对应的是具有模糊性的自然语言.

42. In the second part, we study the structure of feedforward inverse finite automata in general case, and we also discuss the structure of weakly invertible finite automata.

在第二部分中，我们研究了较一般情形下前馈逆有限自动机的结构，并且讨论了弱可逆有限自动机的结构。

43. Researchers into nonlinear systems and cellular automata at the Santa Fe Institute and elsewhere have demonstrated that simple, undirected processes can yield extraordinarily complex patterns.

在美国圣塔菲研究所与其他研究机构，研究非线性系统与细胞自动机的科学家已经证明，简单又没有方向的过程可以产生极为复杂的模式。

44. Two hundred of the best craftspeople in the UK creating automata, dolls, rocking horses, miniatures, puppets, teddy bears and wooden toys, often by hand, are members of the British Toymakers Guild.

在英国，200名最佳手工艺者自己动手制作自动玩具、洋娃娃、摇摆木马、微型玩具、木偶、玩具熊和木制玩具，他们也是英国玩具制造商协会的会员。

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

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

46. Over the past twenty years, automata and formal languages have become the standard introductory theory course in both the undergraduate and graduate curricula of computer science.

在过去的二十年里，自动机和形式语言成了计算机科学研究生和本科生标准的导论性课程。

47. In this process, you can see the self-replication Langton laps chou self-reproduction procedures also Langton's Ant Cellular Automata and so on.

在这个程序中，你能看到Langton的自我复制圈、chou的自我复制程序还有Langton的蚂蚁细胞自动机等等。-fate of the important features is a self-propagation, which is self-reproduction.

48. In this course we concentrate on languages (e.g. sets of words) described by finite automata, context-free grammars and Turing machines.

在这本书中我们集中讲述由有限自动机、上下文无关文法和图灵机所描述的“语言”（单词的集合）。

49. EHUD SHAPIRO and YAAKOV BENENSON began collaborating to build molecular automata in 1999.

夏比洛和班纳森从1999年开始合作设计分子自动机。

50. If a language can not satisfy the condition, it mustn't be accepted by a timed tree automata.

如果一个语言不能满足该条件，它一定不能被时间树自动机识别。

51. If you haven't done a lot of work with these topics, be prepared to learn a whole slew of new termonolgy and concepts: deterministic finite automata, finite state automata, LR parsing, and more.

如果你对这些东西还没有足够的了解的话，那么你就要准备去学习一些新的术语和概念，比如确定性有限自动机，有限状态自动机，LR剖析器等等。

52. This model is based on the cellular automata (CA) technique from the fractal theory and is integrated into the popular SIMPER algorithm.

它是基于分形理论中的细胞自治（Cellular Automata）的思想，并把它整合到CFD问题的流行算法SIMPLER程序中。

53. In this paper,a basic XSIEQ(XML Stream Query with Immediate Evaluation) machine is defined,which is a framework of XML stream query and a kind of indexed automata based on stack.

定义了基本XSIEQ(XML Stream Query with Immediate Evaluation)机. 它是一个XML流查询框架,是被索引化的、基于栈的自动机;

54. Experimental results on data sets showed that the approach with tree automata compared favorable against some other approaches in the F-score and recall.

实验表明，该方法的抽取性能在查全率和F值方面优于其它的一些数据抽取方法。

55. Cellular automaton models have calculation difficulties when the maximum speeds of the vehicles are different from each other or the number of the vehicles is very large.

对于元胞自动机模型，当各车辆的最大速度不一致且车辆数目较多时，会产生计算困难。

56. For a nondeterministic finite automaton (NFA), a new input may cause the machine to be in more than one state, hence its non-determinism.

对于非确定有限自动机 (NFA)，一个新输入可以导致机器进入多于一个状态，因此是非确定性的。

57. A relationship between the accepting powers of sub logarithmic space bounded two way alternating pushdown automata with and without 1 inkdot is investigated.

对具有 1个墨水点的和没有墨水点的亚对数空间限定交替式下推自动机之间的关系进行研究。

58. The stochastic automata model is obtained by adding sensor information and the occurrence probability of event to the logical model.

将传感器信息和事件发生的可能性信息加入逻辑模型，得到系统的随机自动机模型。

59. Simulations of surface nitridation and nitride precipitation in alloy steels have beeb carried out with cellular automaton modeling.

应用元胞自动机模型对合金钢表面氮化及扩散层中氮化物沉淀过程进行了计算机模拟。

60. In this article,the method of cellular automata(CA)was applied to construct a theoretical model to study plant dispersal,and an annual plant(weed)dispersal in homogenous environment was simulated by using the model.

应用细胞自动机方法构造了用于研究一年生植物扩散的理论模型并应用该模型模拟了一年生植物(杂草)种群在同质环境中的扩散.

61. It also introduces perfect automata as an abstract mathematics model of defining the com mand analyzer.Besides, this paper gives formal description of the command analyzer o f the model.

引入了完备自动机作为定义命令分析器的一种抽象数学模型，并用该模型给出了命令分析器的形式化描述。

62. Concept of grey hybrid automata is introduced, and the definitions of grey hyperbolic hybrid automata and their whitening solutions are gived.

引入了灰色混杂自动机的概念，给出了双曲型灰色混杂自动机及其白化解的定义。

63. The biped Inorganics, and the massive Inorganic feline automata called Hellcats, were immobilized once the huge brain controlling them was deactivated.

当控制他们的因维主脑一旦被弄的失能后，这些双足因维德无机奴仆和被叫成地狱猫的猫状因维德自控机甲就再难挪动一步。

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

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

65. So you wanna dress up in a monkey suit and tie every day? Like an automaton robot? Trust me, you can't play hockey in a cubicle. Kind of awkward.

所以,你喜欢每天穿得漂漂亮亮的猴子西服和领带。就像自动机器人一样。告诉你,在办公事的小隔断里面克打不了曲棍球。

66. That is why we returned to our two-state automaton to see if we could at least find something useful for it to accomplish.

所以我们又回到双态自动机，至少可以找找看它是否还有其它用途。

67. So the storage structure of finite automaton should the choosed adjacency lists.

所以，有穷自动机的存储结构最好采用邻接链表来存储。

68. This paper discusses the design of hybrid controller based on hybrid I/O automata s.

探讨了基于模型实现关系和并行合并的混合控制系统的设计和验证问题。

69. Based on timed automata,a rigorous schedulability analysis method of the CAN network with aperiodic real-time messages is developed in the paper.

控制网络的可调度性对网络化控制系统的性能有着重要的影响。

70. In this paper it introduces an approach to compress and code gray image using deterministic Generalized Finite Automata(GFA).

提出一种用确定性的广义有限自动机(GFA)对灰度图像进行压缩编码的方法。

71. An one dimension cellular automata model of network traffic is presented.

提出了一种网络流量的一维元胞自动机模型。

72. This paper proposes a framework of copyright protection based on CA，the framework uses the algorithm of edge detection and cellular automata.

摘要 提出了一种认证中心控制下的版权保护框架，该框架应用了边缘检测与元胞自动机算法。

73. Quantum-dot cellular automata (QCA) is a novel nano-scale computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in molecules.

摘要:量子点细胞元自动化是一种新式奈米层级上的计算机制，它可以利用在分子上电子的表面配置来表示二元资讯。

74. In order to extract data from HTML Web pages automatically, tree automata induction has been used in data extraction.

摘要为了自动将数据从HTML网页中抽取出来，采取树自动机推断方式进行数据抽取。

75. An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression.

摘要介绍了构造等价于给定正则表达式的简化确定有限自动机(DFA)的算法。

76. In this paper, using VC as simulation tool we build up a two-dimensional Cellular Automaton to analyze and simulate the traffic flow at the intersection.

摘要以VC语言为开发工具，通过构造二维元胞自动机模型，时平面十字交叉路口的交通流进行了分析和模拟控制。

77. On basis of cellular automaton model and CS model, with the help of multithread, high-speed updating of the whole simulation system of large-scale traffic network was realized.

摘要以元胞自动机模型为微观模型，以CS模型为指导构建二维的大规模交通网络，利用多线程机制实现了整个模拟系统的高速运行。

78. A three-dimensional quantum cellular neural network is proposed by using the quantum cellular automata as neuron cells.

摘要以量子细胞自动机为神经元，提出了一种三维的量子细胞神经网络结构；

79. According to the characteristics of elementary cellular automaton, the function forms of elementary cellular automaton evolution rules are deduced by using the Karnaugh map.

摘要依据初等元胞自动机演化规则的特点，借助卡诺图化简，导出初等元胞自动机演化规则的函数形式。

80. Cellular automata is a model that can simulate complex structure and process.

摘要元胞自动机是可模拟复杂结构和过程的模型。