finite-state automata 中文意思是什麼

finite-state automata 解釋
有限狀態自動機
  • finite : adj. 有限的；【語法】限定的；【數學】有窮的，有盡的。n. 〈the finite〉 有限（性）； 〈集合詞〉有限物。adv. -ly ,-ness n.
  • state : n 1 〈常作 S 〉國，國家；〈通例作 S 〉（美國、澳洲的）州；〈the States〉 美國。2 國務，政權，政府...
  • automata : n. automaton 的復數。
  1. 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型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  2. 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教授、應明生教授、邱道文教授等人的工作基礎上，提出了詞計算的兩種新的形式模型? ?基於格值有限狀態自動機的詞計算形式模型和基於格值正則文法的詞計算形式模型，對詞計算的形式模型作了進一步研究和探討。
  3. Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ), a dfa has been designed, which can identify multiple kind numbers

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

    然後，給出了基於格值有限狀態自動機的數值計算的形式模型。同時，建立了輸入是詞的格值有限狀態自動機的轉移函數以及格值有限狀態自動機所接收的語言的定義。
  5. 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

    根據過程執行的特點，定義了一種以活動為中心的反應式過程元模型，並為其提供了一種圖形表示，同時為此元模型指定了一種體現過程運行時行為的動態語義，該語義可表示為一個有限狀態自動機.最後舉例說明了如何應用它分析過程模型的語義正確性
  6. 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

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

    它使用基於規則的推理系統，有限狀態自動調節器以及機器自我學習等技術，以一個稱之為配方的形式來安排各種復雜的任務。
  8. 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型模糊有限狀態自動機的一種狀態最小化約簡演算法。
  9. Generalized definition and discussion of some concepts in finite state automata

    有限狀態自動機中幾種概念的泛化定義及探討
  10. This dissertation presents a model for composite event detection based on the framework for large - scale event notification services, discussing the ced based on the event model, time model and observation model, and then presents a ced model based on finite state automata extended with a time model, parameterization and concurrent model. based on the above studies, a dynamically extensible and configurable architecture of distributed event notification service is designed, which is presented based on configuration management and meta - service mechanisms with the ability to customize and extend the subscription, event description, interaction protocol and configuration languages

    論文在大規模事件通知服務的通用框架基礎上，分別從事件系統的事件模型、時間模型和觀察模型探討了復合事件的檢測技術，在傳統的有窮狀態自動機基礎上擴充了時間模型、參數化機制和並發模型，提出了一種基於自動機的有效復合事件檢測方法，並將該方法與各種主流方法進行了對比分析。
分享友人
分享到 Line

分享到臉書