fuzzy automata 中文意思是什麼

fuzzy automata 解釋
模糊自動機
  • fuzzy : adj. 1. 有茸毛的,覆著細毛的,如茸毛的。2. 不清楚的。fuzziness n.
  • automata : n. automaton 的復數。
  1. Max - product fuzzy context - free grammars and pushdown automata

    上下無關文法與下推自動機
  2. 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型模糊有限狀態自動機被建立。
  3. 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型模糊有限自動機,都存在一個與之等價的狀態最小化模糊有限自動機,並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  4. This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata

    本文研究了模糊有限自動機的分類和模糊有限自動機的狀態最小化演算法。
  5. 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

    同時,在新分類中,在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關系被證明和獲得。
  6. An approach of learning fuzzy rules based on learning automata arrays

    基於學習自動機陣列的模糊規則學習方法
  7. 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模式匹配和有限自動機匹配的思想。
  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. 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型模糊有限自動機)之間的異同點,得到了量子自動機與模糊有限自動機關系的一些初步想法。
分享友人