finite automata 中文意思是什麼

finite automata 解釋
有限時序機
  • finite : adj. 有限的；【語法】限定的；【數學】有窮的，有盡的。n. 〈the finite〉 有限（性）； 〈集合詞〉有限物。adv. -ly ,-ness n.
  • automata : n. automaton 的復數。
  1. Finite automata model for one type of dna computing system

    計算系統的有限自動機模型
  2. Minimize connective finite automata and its complexity

    連接型自動機的極小化及其復雜性
  3. 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型模糊有限狀態自動機被建立。
  4. 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型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  5. Tao rj. invertibility of finite automata. beijing : science press, 1979 ( in chinese )

    陶仁驥.有限自動機的可逆性.北京:科學出版社， 1979
  6. 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

    摘要盡管鄰接矩陣是有窮自動機的一種常用存儲方法，但是，鄰接矩陣並不適合存儲所有類型的有窮自動機。
  7. A finite automata model for optimistic contract signing protocols

    樂觀電子合同簽訂協議的一種有限狀態機模型
  8. 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教授、應明生教授、邱道文教授等人的工作基礎上，提出了詞計算的兩種新的形式模型? ?基於格值有限狀態自動機的詞計算形式模型和基於格值正則文法的詞計算形式模型，對詞計算的形式模型作了進一步研究和探討。
  9. This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata

    本文研究了模糊有限自動機的分類和模糊有限自動機的狀態最小化演算法。
  10. Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ), a dfa has been designed, which can identify multiple kind numbers

    摘要基於有限自動機的多模式匹配演算法（ dfsa演算法） ，設計出同時識別多種數的有限自動機。
  11. 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

    同時，在新分類中，在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關系被證明和獲得。
  12. Then we also formulate the model of computing with values via lattice - valued finite state automata, as well as the state transition function of the model of computing with words via lattice - valued finite state automata and the language accepted by lattice - valued finite automata

    然後，給出了基於格值有限狀態自動機的數值計算的形式模型。同時，建立了輸入是詞的格值有限狀態自動機的轉移函數以及格值有限狀態自動機所接收的語言的定義。
  13. According to the characteristics of workflow process execution, a kind of reactive activity - centered process meta - model is defined and a kind of graphical notation is provided for it, at the same time, for this meta - model, a kind of dynamic semantics is specified, which represents the runtime behavior of the process and can be expressed as a finite state automata. finally, an example is given to illustrate how to apply it to analyze the semantic correctness of process models

    根據過程執行的特點，定義了一種以活動為中心的反應式過程元模型，並為其提供了一種圖形表示，同時為此元模型指定了一種體現過程運行時行為的動態語義，該語義可表示為一個有限狀態自動機.最後舉例說明了如何應用它分析過程模型的語義正確性
  14. Cellular automata was applied to solve mechanical problem of plane truss, and the feasibility of which was discussed in this article. the characteristic of cell and the way of dividing cell were studied while presenting a program and its frame chart. the work load of the new method was not much because it neednt form a partial differential set or a general finite element robustness matrix. numerical computing results show that the new method has a rapid speed of convergence to nodal displacement and internal force of element, so it probably has a good prospect in solving solid mechanical problems

    嘗試用細胞自動機作平面桁架力學分析，探討了該方法的可行性.給出元胞的劃分方法和特性，列出計算框圖並編制了相應的程序，由於不必形成結構的偏微方程集或有限元的總體剛度矩陣，計算工作量小.算例表明，該方法對結點位移和桿內力的收斂速度均較快，是一種分析固體力學問題有前景的新方法
  15. 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

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質，使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是，這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長，以至於在很多情況下，窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時，還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系，文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示，此演算法在某些情況下比其他一些工具有更好的時間和空間效率
  16. It uses techniques from rule - based reasoning systems, finite state automata, and machine learning to orchestrate complex tasks in a form it calls recipes

    它使用基於規則的推理系統，有限狀態自動調節器以及機器自我學習等技術，以一個稱之為配方的形式來安排各種復雜的任務。
  17. 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模式匹配和有限自動機匹配的思想。
  18. Specifical, the main results are as follows : 1. lattice - valued finite automata. we introduce the conpect of lattice - valued finite automata

    本文主要採用了比較和類比、分析與綜合、歸納、反證等研究方法。
  19. 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型模糊有限自動機）之間的異同點，得到了量子自動機與模糊有限自動機關系的一些初步想法。
  20. Lastly, we obtain a key theorem which charactarize the link between computing with words via lattice - valued finite automata and computing with numbers via lattice - valued finite automata. 2. lattice - valued regular grammar

    最後，嚴格證明了一個刻畫基於格值有限狀態自動機的數值計算和基於格值有限狀態自動機的詞計算之間的聯系的一個基本定理。
分享友人
分享到 Line

分享到臉書