自動機動 的英文怎麼說
中文拼音 [zìdòngjīdòng]
自動機動
英文
automatic maneuver-
So the storage structure of finite automaton should the choosed adjacency lists
所以，有窮自動機的存儲結構最好採用鄰接鏈表來存儲。Remove irrelevant atomic formulas for timed automaton model checking
時間自動機的模型檢驗中消除無關原子約束A time constraint is a conjunction of atomic formulas which bound the differences of clock values
時間自動機是可以用於對實時系統建模的有效工具。In this paper, it is shown that some atomic formulas of symbolic states generated by the algorithms can be removed to improve the model checking time - and space - efficiency. such atomic formulas are called as irrelevant atomic formulas. a method is also presented to detect irrelevant formulas based on the test - reset information about clock variables
一個時間自動機是一個五元組n ， l 0 ， c ， e ， i ，其中n為一個有窮的位置集合， l 0n是初始狀態， c是一個取實數值的時鐘變量的有窮集合， e ng c 2 cn是轉換的集合。Figure recognition based on deterministic finite automat
圖形識別的有限自動機方法Preliminary study on accelerating technique of cellular automat a method
細胞自動機方法加速技術初探Theory of automat
自動機理論Cellular automata simulation of dendritic crystal growth
枝晶生長的元胞自動機模擬Finite automata model for one type of dna computing system
計算系統的有限自動機模型A feasible method for achieving finite automaton
有限自動機的類類型實現方法Minimize connective finite automata and its complexity
連接型自動機的極小化及其復雜性Max - product fuzzy context - free grammars and pushdown automata
上下無關文法與下推自動機The review and prospect of urban cellular automata model
城市細胞自動機模型研究的回顧與展望Repeated prisoner ' s dilemma game model based on mealy automaton
自動機的重復囚徒困境博弈模型In the second part, the focuses are put on the methods of realization of atc instruction speech recognition, automatic pilot reply text - to - speech, management of sky talk dialogue and aircraft state feed back display
第二部分重點研究了本系統的管制指令語音識別、自動機長語音合成、陸空通話管理器和飛行信息反饋顯示四個模塊的具體設計方法及過程。Software development for automated sale machine on the basis of automatism theory
基於自動機原理的自動售貨機軟體的實現Existing complexity proofs on the circularity problem of ags are based on automata theory, such as writing pushdown acceptor and alternating turing machines
目前對屬性文法循環性問題復雜度的證明，多基於自動機理論，如寫入推出接受器、交替塗林機等。In chapter 2, a class of fuzzy finite automata corresponding to the mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced
在第二章中，對應于經典mealy型有限狀態自動機的一類模糊有限狀態自動機-新mealy型模糊有限狀態自動機被建立。From the equivalence relations, a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained. in chapter 3, a fuzzy finite automata with a fuzzy initial state that was first considered by m. mizumoto, j. toyota and k. tanaka in 1969 is introduced. based on the mizumoto type of fuzzy finite automata, a statewise equivalence relation is considered
在第三章中，我們首先介紹了一類有模糊初始狀態的模糊有限自動機- mizumoto型模糊有限自動機，然後定義了兩種狀態等價和兩種模糊有限自動機等價的概念，接著證明了對于每一個mizumoto型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。Study of virtual prototyping of the dynamics of large calibre machine - gun self - actor
某大口徑重機槍自動機動力學的虛擬樣機技術研究分享友人