有限自動機 的英文怎麼說
中文拼音 [yǒuxiànzìdòngjī]
有限自動機
英文
automata theory- 有 : 有副詞[書面語] (表示整數之外再加零數): 30 有 5 thirty-five; 10 有 5年 fifteen years
- 限 : Ⅰ名詞(指定的范圍; 限度) limit; bounds Ⅱ動詞(指定范圍, 不許超過) set a limit; limit; restrict
- 自 : Ⅰ代詞(自己) self; oneself; one s own Ⅱ副詞(自然;當然) certainly; of course; naturally; willin...
- 機 : machineengine
- 有限 : limited; restricted; finite; a little; not much
-
Figure recognition based on deterministic finite automat
圖形識別的有限自動機方法Finite automata model for one type of dna computing system
計算系統的有限自動機模型A feasible method for achieving finite automaton
有限自動機的類類型實現方法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型模糊有限自動機,都存在一個與之等價的狀態最小化模糊有限自動機,並且給出了一個狀態最小化約簡演算法及其演算法終止條件。Tao rj. invertibility of finite automata. beijing : science press, 1979 ( in chinese )
陶仁驥.有限自動機的可逆性.北京:科學出版社, 1979In chapter 4, the model - building principle and calculating method of finite element dynamic analysis for large - sized assembled structure are discussed. the substructure model for hydropower house vibration analysis is established to obtain precise modal of generator floor. the harmonic vibration assumption is adopted to calculate house structure ' s dynamic response from hydraulic excitation force of hydraulic turbine generator unit
第四章討論了大型組合結構有限元動力分析的建模原則和計算方法,建立水電站廠房振動分析的下部結構模型,對巖灘廠房進行整體模態分析,較準確地得出發電機層樓板自振特性;同時引進簡諧振動假定,迸行了機組水力振動作用下的廠房結構的動力響應分析。In the compiled system, the paper describes symbolic structure of the siprom language word with regular expression. based on the fa theory, this paper presents a lexical analysis method by using morphology table. after comparing some common syntax analysis methods, this paper choosing the lr ( 1 ) analyzer
在編譯部分,本文用正規表達式描述了siprom語言單詞符號的結構,利用有限自動機原理,提出了用構造詞形表的方式來識別單詞的方法,使詞法分析程序具有很好的開放性。Based on lotfi a. zadeh ’ s work, mingsheng ying ’ s work and daowen qiu ’ s work, the author proposed two new formal models of computing with words, namely the formal model of computing with words via lattice - valued finite state automata and the formal model of computing with words via lattice - valued regular grammar. the formal model of computing with words is expored and investigated
本文在lotfia . zadeh教授、應明生教授、邱道文教授等人的工作基礎上,提出了詞計算的兩種新的形式模型? ?基於格值有限狀態自動機的詞計算形式模型和基於格值正則文法的詞計算形式模型,對詞計算的形式模型作了進一步研究和探討。Several properties of two operators of fuzzy finite aatomata
模糊有限自動機兩個運算元的若干性質As discussed last month, i plan to use deterministic finite automaton to compile the proxy
如上個月所討論的,我計劃用確定性有限自動機( deterministic finite automaton , dfa )來編譯該代理。This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata
本文研究了模糊有限自動機的分類和模糊有限自動機的狀態最小化演算法。This task can be achieved by a finite automaton with just two states and a “ program ” consisting of four statements called transition rules
有限自動機在執行這項工作時,只需要兩個狀態和一套含四則轉換規則的程序。Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ), a dfa has been designed, which can identify multiple kind numbers
摘要基於有限自動機的多模式匹配演算法( dfsa演算法) ,設計出同時識別多種數的有限自動機。Based on this classification, some important types of fuzzy finite automaton are classified. in the meantime, the relations among these fuzzy finite automata in same models are obtained
同時,在新分類中,在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關系被證明和獲得。Winfree proved that self - assembling tile systems in a plane are capable of doing universal computation, and when restricted to a line are exactly as powerful as discrete finite automa
Winfree已經證明平面上的片裝配系統能做通用的計算,而線性自裝配模型的計算能力相當于離散的有限自動機。So a fast pattern matching algorithm on mass string assemble has been proposed to solve the problem of fuzzy matching between a string pattern and a string assemble. to make the algorithm cost - effective in space and time, we have developed an optimized trie - tree structure to store the string assemble and introduced the knuth - morris - pratt ( kmp ) and finite - automata ( fa ) string matching thought to our algorithm. the algorithm has been describled in details and the cost of space and run time has been analized in the thesis
為了實現漢字輸入碼的不完整輸入,解決帶有模糊輸入符的字元串模式與一個字元串集合之間的匹配問題,論文在第三章提出一種海量字元串集合的模式匹配演算法,給出了演算法的具體實現和復雜度分析,並且提出一種優化的檢索樹結構來存儲字元串集合以節省內存空間。為了提高演算法的運行速度,演算法還引入了kmp模式匹配和有限自動機匹配的思想。From the equivalence relation, a minimal form is defined and a minimization algorithm of the mizumoto type of fuzzy finite automata is obtained. in chapter 4, quantum automata are introduced. we compare and contrast quantum automata with fuzzy finite automata, obtain some elementary relations and leave a set of open questions
在第四章中,首先了介紹量子自動機的概念,然後著重比較量子自動機與一種模糊有限自動機(即mizumoto型模糊有限自動機)之間的異同點,得到了量子自動機與模糊有限自動機關系的一些初步想法。Because the two - state finite automaton was too simple to be of any use in solving complex computational problems, we considered it nothing more than an interesting demonstration of the concept of programmable, autonomous biomolecular computers, and we decided to move on
由於雙態有限自動機過于簡單,無法解決任何復雜的計算問題,我們只是用它來驗證程序化、自動化生物分子計算機觀念可行而已。In this paper, first an overview and analysis is given of existing typical algorithms for real - time audio - stream segment then a algorithm base on energy is proposed to audio - stream segment. the utilization of message - action finite state automaton is also required to control different complex playback pattern
本文首先歸納和分析了當前語音檢測的典型演算法,通過綜合比較,然後提出了一個基於能量的應用於教學系統的實時音頻流分割的演算法,首先對語音進行濾波除噪的預處理,然後利用語音的能量特徵進行分割,最後利用有限自動機進行多模式控制。分享友人