finite automaton 中文意思是什麼

finite automaton 解釋
有限狀態機 [有限自動機
  • finite : adj. 有限的；【語法】限定的；【數學】有窮的，有盡的。n. 〈the finite〉 有限（性）； 〈集合詞〉有限物。adv. -ly ,-ness n.
  • automaton : n. （pl. automatons, -ta ）1. 自動物；自動玩具；自動開關；自動裝置。2. 機械式工作的人。
  1. So the storage structure of finite automaton should the choosed adjacency lists

    所以，有窮自動機的存儲結構最好採用鄰接鏈表來存儲。
  2. A feasible method for achieving finite automaton

    有限自動機的類類型實現方法
  3. Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata

    摘要盡管鄰接矩陣是有窮自動機的一種常用存儲方法，但是，鄰接矩陣並不適合存儲所有類型的有窮自動機。
  4. Grammar inference has received more and more attention due to its wide application. this paper is concerned with the combination of several optimal algorithms with this research field. in chapter 1, we begin with some results of the grammar inference using neural networks and then a construction method is proposed to induce the fuzzy finite state automaton

    文法推理由於其廣泛的應用前景而受到越來越多的關注，它已被成功地應用於：句法模式識別[ 13 ] ，演講和自然語言的處理，基因分析，圖像處理，序列預測，信息檢索，密碼術等等。
  5. As discussed last month, i plan to use deterministic finite automaton to compile the proxy

    如上個月所討論的，我計劃用確定性有限自動機（ deterministic finite automaton ， dfa ）來編譯該代理。
  6. This task can be achieved by a finite automaton with just two states and a “ program ” consisting of four statements called transition rules

    有限自動機在執行這項工作時，只需要兩個狀態和一套含四則轉換規則的程序。
  7. 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

    同時，在新分類中，在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關系被證明和獲得。
  8. Deterministic finite state automaton

    決定型有限狀態機
  9. Alternating finite automaton

    交替式有限狀態自動機
  10. This algorithm recovers the absence of the empiric in the case of the fixed - topology network and generates an optimal topology automatically. we end this chapter with some problems in the future. in chapter 2, we present an evolution strategy to infer fuzzy finite - state automaton, the fitness function of a generated automaton with respect to the set of examples of a fuzzy language, the representation of the transition and the output of the automaton and the simple mutation operators that work on these representations are given

    目前，國內外對神經網路與自動機的結合的研究己取得了一系列成果；在第一章，我們首先將對這些結果以及這個領域的研究思想與方法做一個概要的介紹；然後提出一種推導模糊有限狀態自動機的構造性演算法，解決了模擬實驗中所給出的具體網路的隱藏層神經元個數的確定問題；在實驗中，我們首先將樣本輸入帶1個隱藏層神經元的反饋網路訓練， 150個紀元以後增加神經元，此時的新網路在124紀元時收斂；而blanco [ 3 ]的固定性網路學習好相同的樣本需要432個紀元。
  11. A widely used method for checking real - time systems is, according to the real - time property to be checked, to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space. the algorithm needs only to explore the finite space to get a correct answer. in most cases, exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases. in this paper, an equivalence relation is introduced to check whether a concurrent system, which is composed of a finite set of real - time automata, satisfies a linear duration property. to avoid exhaustive exploration, this paper also introduces a compatibility relation between timed states ( configurations ). based on these two relations, an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property. the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質，使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是，這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長，以至於在很多情況下，窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時，還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系，文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示，此演算法在某些情況下比其他一些工具有更好的時間和空間效率
  12. Functions of the interface, event, context dependence relationship and content dependence relationship in component - based software were analyzed with regard to integration testing. the difficulty in acquiring these four factors was also analyzed. a dfa ( deterministic finite automaton ) model based on the characteristics of component - based software was proposed so that these four factors could be acquired from the model. an example was given to prove the validity of the model

    分析了構件化軟體介面、事件、上下文及內容依賴關系在集成測試中的作用，以及提取該四要素的難度;針對構件化軟體的自身特點提出了一種有限狀態自動機模型，利用該模型實施對四要素的提取，並通過實例驗證了該模型的有效性。
  13. In this thesis, we study the non - invertible linear finite autonomous automata and derive the following new results : 1. a formula is given to count the number of the nodes of every level in a down - oriented tree of an autonomous automaton. then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact - equibranch down - oriented tree [ theorem 3. 2 - 3. 3 ]

    本文研究了布爾代數上非可逆的線性內動機，取得了下列成果： （ 1 ）給出了線性內動機下向樹形中每一層節點的計數公式和下向樹是等叉下向樹形的判定條件[定理3 . 2 3 . 3 ] 。
  14. As a special case of lattice - valued finite state automata, mizumoto fuzzy finite state automaton is considred. furthermore, we obtain a minimization algorithm of mizumoto fuzzy automata. we obtain our results mainly by compare and contrast, analysis and synthesis, induction and reduction to absurdity

    此外，本文對格值有限狀態自動機的一種特殊類型? ? mizumoto型模糊有限狀態自動機的狀態最小化約簡問題也作了一些探討，給出了mizumoto型模糊有限狀態自動機的一種狀態最小化約簡演算法。
  15. 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

    由於雙態有限自動機過于簡單，無法解決任何復雜的計算問題，我們只是用它來驗證程序化、自動化生物分子計算機觀念可行而已。
  16. 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

    本文首先歸納和分析了當前語音檢測的典型演算法，通過綜合比較，然後提出了一個基於能量的應用於教學系統的實時音頻流分割的演算法，首先對語音進行濾波除噪的預處理，然後利用語音的能量特徵進行分割，最後利用有限自動機進行多模式控制。
  17. ( 2 ) based on dfsa algorithm ( deterministic finite state automaton ) and combined with quick search algorithm, this paper analyses and implements a new multi - pattern string match algorithm that consumes less half of memory space of standard dfsa algorithm

    該演算法是以確定性有限狀態自動機（ dfsa ）為基礎，結合quicksearch演算法而提出的，可以用來提高主題爬行器的網頁分析和web網頁分類器的速度。
  18. Process behavior and process state have some kind of intrinsic relations. this paper discusses the relation based on the category and integrated deterministic finite automaton. this paper established a process detection model based on category ( cpdm ), and proposed a state - based process detection technique

    本文以范疇論為基礎，結合確定性有限狀態自動機，對這種關系進行了研究和論證，建立了基於范疇論的進程檢測模型（ cpdm ， processdetectionmodelbasedoncategory ） ，並在此基礎上給出了基於狀態的進程檢測技術。
分享友人
分享到 Line

分享到臉書