有限態自動機 的英文怎麼說

中文拼音 [yǒuxiàntàizìdòngjī]
有限態自動機 英文
finit state automation
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 限 : Ⅰ名詞（指定的范圍; 限度） limit; bounds Ⅱ動詞（指定范圍, 不許超過） set a limit; limit; restrict
  • 態 : 名詞1. （形狀; 狀態） form; condition; appearance 2. [物理學] （物質結構的狀態或階段） state 3. [語言學] （一種語法范疇） voice
  • 自 : Ⅰ代詞（自己） self; oneself; one s own Ⅱ副詞（自然;當然） certainly; of course; naturally; willin...
  • 機 : machineengine
  • 有限 : limited; restricted; finite; a little; not much
  1. 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型模糊有限狀態自動機被建立。
  2. 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型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  3. The content of this thesis comes from the fujian natural science found following research task 。 it studies on a space cantilever single beam attached to a moving support 。 inertia forces which are brought by the support ' s movement ， are acceded to the equivalent initiative forces and the equivalent initiative moments 。 when we consider the relation of the forces and deformation ， we change the method of material mechanical analysis to the elastic mechanical analysis 。 further more ， we discusses the feasibility of the method which uses the multi - rigid - body discrete model to simulate the dynamic characteristic of a elastic body 。 first ， the finite segment method is adopted to establish the models of the beam 。 based on kane ' s equations ， dynamic math - model for the beam are derived 。 and by use of c - language and runge - kutta procedure ， the computer - oriented procedure can give the whole responses of the beam 。 second ， with compare to the numerical examples ， the method which uses the multi - rigid - body discrete model to simulate the dynamic characteristic of a elastic body which is under the condition of movement is verified to be feasible 。

    本論文為福建省自然科學基金后續研究課題，以已知支撐運動的單個空間懸臂梁為對象，在等效主動力與等效主動力矩中加入支撐轉動引起的慣性力，並在考慮力與變形關系時，用更一般的彈性力學分析代替材料力學分析，進一步研究用多剛體離散模型來模擬其動力學特性的可行性。首先，用有限段建立機械臂的多剛體離散模型，用kane動力學方法建立其動力學方程。並用c語言編制演算法程序，採用了四階runge - kutta積分程序求解微分方程組，給出構件的全部動態歷程。
  4. 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教授、應明生教授、邱道文教授等人的工作基礎上，提出了詞計算的兩種新的形式模型? ?基於格值有限狀態自動機的詞計算形式模型和基於格值正則文法的詞計算形式模型，對詞計算的形式模型作了進一步研究和探討。
  5. Its basic motive power is unity of opposites between natural - ecological subsystem with a stable growth and a limited supply and social - economic subsystem with an unlimited demand. in essence its development process is a dialectical, balanced - unbalanced - balanced process like a spiral between social - economic demand and natural - ecological supply. during the process the key to its operation state is the way and the extent of mankind ' s activities interfering with natural - ecological subsystem

    鄱陽湖區農業自然資源利用演變的基本動因是具有增長型機制並對自然資源需求無限的社會經濟子系統與具有穩定型機制的自然資源供給有限的自然生態子系統之間的對立統一；湖區農業自然資源利用的演變過程實質上是一個螺旋式上升的辯證發展過程，是社會經濟子系統需求與自然生態子系統供給之間平衡失衡平衡的發展過程。
  6. Alternating finite automaton

    交替式有限狀態自動機
  7. 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

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

    根據過程執行的特點，定義了一種以活動為中心的反應式過程元模型，並為其提供了一種圖形表示，同時為此元模型指定了一種體現過程運行時行為的動態語義，該語義可表示為一個有限狀態自動機.最後舉例說明了如何應用它分析過程模型的語義正確性
  9. 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個紀元。
  10. Acquiring testing factors in component software integration based on dfa model functions of the interface, event, context dependence relationship and content dependence relationship in componentbased software were analyzed with regard to integration testing. the difficulty in acquiring these four factors was also analyzed

    分析了構件化軟體介面事件上下文及內容依賴關系在集成測試中的作用，以及提取該四要素的難度針對構件化軟體的自身特點提出了一種有限狀態自動機模型，利用該模型實施對四要素的提取，並通過實例驗證了該模型的有效性。
  11. 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

    分析了構件化軟體介面、事件、上下文及內容依賴關系在集成測試中的作用，以及提取該四要素的難度;針對構件化軟體的自身特點提出了一種有限狀態自動機模型，利用該模型實施對四要素的提取，並通過實例驗證了該模型的有效性。
  12. The pulsar system is developed with the following parts : the robust feature extraction based on auditory mechanisms, acoustic modeling with mandarin pronunciation characteristics, search space building based on wfst, and efficient global decoding scheme

    本研究實現的系統pulsar包括：基於聽感知機理的抗噪聲特徵提取，針對漢語發音特點的聲學建模，基於加權有限狀態自動機（ wfst ）的搜索空間，融合聲學模型和語言模型的高效全局解碼。
  13. 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型模糊有限狀態自動機的一種狀態最小化約簡演算法。
  14. The extended finite state automation ( efsa ) is adopted to match pattern written by asl in the thesis. it is also said that the rules are translated into efsa while compiling the rules, the method have high performance in the run time, the pattern matching time is insensitive to the numbers of rules

    文中模式匹配採用了擴展的有限狀態自動機（ efsa ）演算法，也就是在編譯規則的時候將規則轉換成擴展的有限狀態自動機，這個方法提高了運行時執行的效率，使得匹配的時間與規則的多少基本無關。
  15. 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

    最後，嚴格證明了一個刻畫基於格值有限狀態自動機的數值計算和基於格值有限狀態自動機的詞計算之間的聯系的一個基本定理。
  16. Definite state automaton

    有限狀態自動機
  17. The paper proposes a method using finite state automation describing programming system call action via analyzing system call character, proving the finite state automation ' s completeness and giving the result of arithmetic performance

    摘要通過分析系統調用行為特徵，提出了程序的系統調用行為可以用有限狀態自動機來描述的方法，證明了演算法產生的自動機的完整性，並給出演算法性能分析結果。
  18. ( 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網頁分類器的速度。
  19. Generalized definition and discussion of some concepts in finite state automata

    有限狀態自動機中幾種概念的泛化定義及探討
  20. 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

分享到臉書