automata
美 [??tɑm?t?n] 
英 [???t?m?t?n]
- n.自動(dòng)物；自動(dòng)玩具；自動(dòng)開關(guān)；自動(dòng)裝置
- 網(wǎng)絡(luò)自動(dòng)機(jī)；自動(dòng)人偶；自動(dòng)之物
詞形變化
復(fù)數(shù)：automatons 復(fù)數(shù)：automata
英漢解釋
n. | 1. 自動(dòng)物;自動(dòng)玩具;自動(dòng)開關(guān);自動(dòng)裝置 |
英英解釋
例句
In language theory , the simplest algorithms are those which can be implemented by finite automata, the subject of this book.
在語(yǔ)言理論，最簡(jiǎn)單的一類算法就是可以用有限自動(dòng)機(jī)實(shí)現(xiàn)的算法，也是本書的主題。
Inorder to begin to answer the central question of automata theory, it is necessary to define in a formal way what an automaton is.
為了開始回答的核心問(wèn)題的自動(dòng)機(jī)理論，有必要確定一個(gè)正式的方式在一個(gè)自動(dòng)機(jī)是什么。
According to the theory of Cellular Automata, we built an improved traffic-flow model, and gave the evolving rules of every vehicle.
根據(jù)元胞自動(dòng)機(jī)理論建立改進(jìn)的交通流模型，給出每輛車的演化規(guī)則。
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
有限自動(dòng)機(jī)理論是一類簡(jiǎn)單類算法的數(shù)學(xué)理論，這些算法理論這些數(shù)學(xué)雖然簡(jiǎn)單但對(duì)計(jì)算機(jī)科學(xué)很重要。
As a branch of artificial intelligence, cellular automata can be used to model and simulate the complex systems and artificial life systems.
而細(xì)胞自動(dòng)機(jī)作為人工智能的一個(gè)分支學(xué)科，可以用于復(fù)雜系統(tǒng)和人工生命系統(tǒng)的建模思想。
Since the simplicity of component unit in cellular automata, it has a unique advantage in the password field.
由于元胞自動(dòng)機(jī)有組成單元的簡(jiǎn)單性，使得它在密碼學(xué)領(lǐng)域有著獨(dú)特的優(yōu)勢(shì)。
One of us (Macdonald) led the project and trained several high school students to test automata , mostly during summers and on Saturdays.
這個(gè)計(jì)畫由麥當(dāng)諾領(lǐng)導(dǎo)，他培訓(xùn)了許多高中生來(lái)測(cè)試，大多是利用暑假和星期六來(lái)工讀。
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高級(jí)課程中還包括了可計(jì)算包括理論模型理論和計(jì)算復(fù)雜性理論。
Use pigeon- holing arguments and closure properties to prove particular problems cannot be solved by finite automata .
運(yùn)用鴿洞理論以及終止屬性來(lái)證明某些特殊無(wú)法用有限自動(dòng)機(jī)解決的問(wèn)題…
We have demonstrated some of the abilities of our DNA gates by building automata that play perfect games of tic-tac-toe.
我們設(shè)計(jì)出了一個(gè)擅長(zhǎng)玩井字游戲的自動(dòng)機(jī)來(lái)展示DNA邏輯閘的一些能力。
Cellular automata(CA) is of discrete dynamical systems within various dynamical behaviors including complex dynamics.
元胞自動(dòng)機(jī)是一種行為復(fù)雜的時(shí)空離散的動(dòng)力系統(tǒng)。
As with all elementary cellular automata, its definition, illustrated in Figure 4, is quite simple -- a small diagram defines it completely.
像所有初級(jí)細(xì)胞自動(dòng)機(jī)一樣，它的定義——如圖4所示——是相當(dāng)簡(jiǎn)單的：一個(gè)小圖就可以完全定義它。
RBC system for the five process timed automata model, as well as other external devices timed automata model are established in the UPPAAL.
對(duì)RBC系統(tǒng)的五個(gè)流程以及其他外部設(shè)備分別在UPPAAL中建立了時(shí)間自動(dòng)機(jī)模型。
Introduces the notion of Finite Precision Timed Automata(FPTA) and focuses on the representation of clocks in a state.
簡(jiǎn)要介紹了有限精度時(shí)間自動(dòng)機(jī)（FPTA）的基本概念，重點(diǎn)討論FPTA狀態(tài)中時(shí)鐘的表示。
Using DCM as a data structure for the reachability analysis algorithm for multirate automata, the complexity can considerably be decreased.
理論上證得，DCM可以大大降低可達(dá)性分析算法的復(fù)雜度。
Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直覺(jué)模糊自動(dòng)機(jī)理論是自動(dòng)機(jī)理論的一個(gè)重要分支。
Developed from Lattice Gas Cellular Automata (LGCA), Lattice-Boltzmann method is a special discrete scheme of Boltzmann equation.
格子-Boltzmann方法是Boltzmann方程的一個(gè)特殊的離散格式，它的前身是格子氣自動(dòng)機(jī)。
Unfortunately, automata theory tells us that no tool could ever statically determine which programs will throw null-pointer exceptions.
不幸的是，自動(dòng)控制理論告訴我們，沒(méi)有工具可以靜態(tài)地決定哪些程序將拋出空指針異常。
The characteristics and theory of lattice gas automata have been introduced.
介紹格子氣自動(dòng)機(jī)方法的原理與特點(diǎn)。
Scanner automata, design of algorithm translation to generate TOKEN, keyword, industry at table, symbol table, constant table.
掃描器的自動(dòng)機(jī)，設(shè)計(jì)翻譯生成TOKEN的算法，關(guān)鍵字，界符表，符號(hào)表，常數(shù)表。
An orthogonal design and cellular automata based acceleration parallel genetic algorithm (APGA) is presented.
為此，結(jié)合正交試驗(yàn)設(shè)計(jì)和元胞自動(dòng)機(jī)模型，提出了一種改進(jìn)的加速并行遺傳算法（APGA）。
Cellular automata are used to bridge the gap between the micro level and the macro level.
用元胞自動(dòng)機(jī)作為宏觀分析與微觀仿真之間的橋梁。
An automata network model is a powerful modeling tool in complex systems. The key character of the method is a bottom-to-up way.
自動(dòng)機(jī)網(wǎng)絡(luò)方法采用自底向上建模的解題思路，是復(fù)雜系統(tǒng)有效的建模分析工具。
By studying elementary cellular automata, Wolfram found that complex behavior could arise from simple mechanisms.
通過(guò)研究初級(jí)細(xì)胞自動(dòng)機(jī)，Wolfram發(fā)現(xiàn)簡(jiǎn)單的機(jī)制可以產(chǎn)生出復(fù)雜的行為。
We can use Cellular Automata modeling diffusion of two different matters and establish sample of evolution law of diffusions. . .
用元胞自動(dòng)機(jī)模擬兩種物質(zhì)的擴(kuò)散過(guò)程，建立擴(kuò)散系統(tǒng)的演化規(guī)則樣本。
Cellular Automata is a kind of dynamic model whose time, space and state are discrete and a method of studying nonlinear science.
元胞自動(dòng)機(jī)是一種時(shí)間、空間、狀態(tài)都離散的動(dòng)力學(xué)模型，是非線性科學(xué)的一種重要的研究方法。
In this course we concentrate on languages (e. g. sets of words) described by finite automata, context-free grammars and Turing machines.
在這本書中我們集中講述由有限自動(dòng)機(jī)、上下文無(wú)關(guān)文法和圖靈機(jī)所描述的“語(yǔ)言”（單詞的集合）。
Finite Automata, Regular Languages, Regular Expressions.
有限自動(dòng)機(jī)，正規(guī)語(yǔ)言，正規(guī)表示式。
In this paper the SEIRS epidemic spread is analysed, and a two-dimensional probability cellular automata model for SEIRS is presented.
本文通過(guò)分析SEIRS類流行病，建立了該類疾病的二維概率細(xì)胞自動(dòng)機(jī)模型。
Until now, a large number of cryptosystems based on chaos and cellular automata have been proposed and systematically analyzed.
目前，已提出了大量基于混沌和細(xì)胞自動(dòng)機(jī)的密碼設(shè)計(jì)方案，并進(jìn)行了系統(tǒng)的分析。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
本文利用排隊(duì)論、有限狀態(tài)自動(dòng)機(jī)原理以及元胞自動(dòng)機(jī)模型對(duì)排隊(duì)系統(tǒng)進(jìn)行建模。
In this paper it introduces an approach to compress and code gray image using deterministic Generalized Finite Automata(GFA).
提出一種用確定性的廣義有限自動(dòng)機(jī)（GFA）對(duì)灰度圖像進(jìn)行壓縮編碼的方法。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
基于確定性有限自動(dòng)機(jī)（DFA）的多模式匹配算法被廣泛用于數(shù)據(jù)包深度檢測(cè)系統(tǒng)中。
NET2005 famous serial achieve Cellular Automata : the game of life, sharks and fish simulation of the marine environment.
使用VC。NET2005串行實(shí)現(xiàn)著名的細(xì)胞自動(dòng)機(jī)程序：生命游戲，模擬鯊魚和小魚的海洋環(huán)境。-useVC。
This paper first briefly introduces timed automata, clock region, region equivalence and clock zone.
首先簡(jiǎn)介了時(shí)間自動(dòng)機(jī)、時(shí)鐘區(qū)域、區(qū)域等價(jià)、時(shí)鐘帶的概念。
second, simulation and analysis of Cellular Automata in the orientation of individual behaviors.
第二，元胞自動(dòng)機(jī)對(duì)個(gè)人行為取向的模擬與分析。
Theory and application of Lattice Gas Automata and Lattice Boltzmann Method in fluid flied is discussed in detail.
本文詳細(xì)敘述了格子氣自動(dòng)機(jī)和格子波爾茲曼方法的基本原理以及其在流體力學(xué)中的應(yīng)用。
I'll concentrate in this article on one-dimensional cellular automata, whose cells can be in one of two states, 0 or 1.
在本文中我將集中討論一維細(xì)胞自動(dòng)機(jī)，它的細(xì)胞可以有兩種狀態(tài)：0或者1。
Nowlets talk about something like, nowadays we have Meta-model, Meta-language, Meta-data, a lot of Meta, so what do you think automata.
現(xiàn)在允許談?wù)?/c>這樣，現(xiàn)在我們已經(jīng)元模型，元語(yǔ)言，元數(shù)據(jù)，很多元，所以你怎么看待元。
The squeegee ground parallel to the cutting edge is located at (Automata) publishes drum of center line.
不兵刮板研磨成平口，刃口位于（被迫機(jī)）承印滾筒的洋心線上。
