finite state algorithm 中文意思是什麼

finite state algorithm 解釋
有限態演算法
  • finite : adj. 有限的;【語法】限定的;【數學】有窮的,有盡的。n. 〈the finite〉 有限(性); 〈集合詞〉有限物。adv. -ly ,-ness n.
  • state : n 1 〈常作 S 〉國,國家;〈通例作 S 〉(美國、澳洲的)州;〈the States〉 美國。2 國務,政權,政府...
  • algorithm : n. 【數學】演算法;規則系統;演段。
  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 multiple patterns match algorithm - deterministic finite state automata ( dfsa ), a dfa has been designed, which can identify multiple kind numbers

    摘要基於有限自動機的多模式匹配演算法( dfsa演算法) ,設計出同時識別多種數的有限自動機。
  3. Abstract : the state space, search heuristics, and move generator in searching solutions to a given problem are characterized by first order language, which implies that the logical properties of a search algorithm are determined by its state space, that is, the logic describing the searching process has compactness and the class of initial states has finite close property

    文摘:搜索演算法的初始空間、搜索策略、搜索過程可以用一階語言描述,搜索演算法的邏輯性質由初始狀態空間確定.這意味著描述搜索過程的邏輯具有緊致性,初始狀態的初等類具有有限封閉性
  4. 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個紀元。
  5. 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

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質,使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是,這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長,以至於在很多情況下,窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時,還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系,文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示,此演算法在某些情況下比其他一些工具有更好的時間和空間效率
  6. After analyzing typical text information extraction inductive algorithms based on wrapper model, making use of the important features of the pages, such as annotations and text pattern features, an inductive algorithm is proposed using wrapper model for information extraction. the new algorithm can add the annotations to the state sets of rule ’ s finite state machine, so it can effectively reduce the time spending on search, and can also accurately locate the target information ; the learned text pattern can be used to filter out the un - interrelated extracted information

    在分析了基於包裝器模型的文本信息抽取典型歸納學習演算法的基礎上,利用頁面的一些重要特性,例如注釋和文本模式信息,提出了一種新的歸納學習演算法,新演算法將注釋信息加入到抽取規則的有限狀態機的狀態序列中,從而能有效地降低演算法搜索時間,並能對目標信息進行充分的定位;並且新演算法能用學習到的文本模式信息對抽取結果進行必要的過濾。
  7. 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型模糊有限狀態自動機的一種狀態最小化約簡演算法。
  8. 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

    本文首先歸納和分析了當前語音檢測的典型演算法,通過綜合比較,然後提出了一個基於能量的應用於教學系統的實時音頻流分割的演算法,首先對語音進行濾波除噪的預處理,然後利用語音的能量特徵進行分割,最後利用有限自動機進行多模式控制。
  9. ( 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網頁分類器的速度。
分享友人