Deterministic finite state automaton 決定型有限狀態(tài)機(jī)
Generalized definition and discussion of some concepts in finite state automata 有限狀態(tài)自動(dòng)機(jī)中幾種概念的泛化定義及探討
Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ) , a dfa has been designed , which can identify multiple kind numbers 摘要基于有限自動(dòng)機(jī)的多模式匹配算法( dfsa算法) ,設(shè)計(jì)出同時(shí)識別多種數(shù)的有限自動(dòng)機(jī)。
It uses techniques from rule - based reasoning systems , finite state automata , and machine learning to orchestrate complex tasks in a form it calls recipes 它使用基于規(guī)則的推理系統(tǒng),有限狀態(tài)自動(dòng)調(diào)節(jié)器以及機(jī)器自我學(xué)習(xí)等技術(shù),以一個(gè)稱之為配方的形式來安排各種復(fù)雜的任務(wù)。
( 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 該算法是以確定性有限狀態(tài)自動(dòng)機(jī)( dfsa )為基礎(chǔ),結(jié)合quicksearch算法而提出的,可以用來提高主題爬行器的網(wǎng)頁分析和web網(wǎng)頁分類器的速度。
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 然后,給出了基于格值有限狀態(tài)自動(dòng)機(jī)的數(shù)值計(jì)算的形式模型。同時(shí),建立了輸入是詞的格值有限狀態(tài)自動(dòng)機(jī)的轉(zhuǎn)移函數(shù)以及格值有限狀態(tài)自動(dòng)機(jī)所接收的語言的定義。
Grammar inference has received more and more attention due to its wide application . this paper is concerned with the combination of several optimal algorithms with this research field . in chapter 1 , we begin with some results of the grammar inference using neural networks and then a construction method is proposed to induce the fuzzy finite state automaton 文法推理由于其廣泛的應(yīng)用前景而受到越來越多的關(guān)注,它已被成功地應(yīng)用于:句法模式識別[ 13 ] ,演講和自然語言的處理,基因分析,圖像處理,序列預(yù)測,信息檢索,密碼術(shù)等等。
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 本文首先歸納和分析了當(dāng)前語音檢測的典型算法,通過綜合比較,然后提出了一個(gè)基于能量的應(yīng)用于教學(xué)系統(tǒng)的實(shí)時(shí)音頻流分割的算法,首先對語音進(jìn)行濾波除噪的預(yù)處理,然后利用語音的能量特征進(jìn)行分割,最后利用有限自動(dòng)機(jī)進(jìn)行多模式控制。
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 此外,本文對格值有限狀態(tài)自動(dòng)機(jī)的一種特殊類型? ? mizumoto型模糊有限狀態(tài)自動(dòng)機(jī)的狀態(tài)最小化約簡問題也作了一些探討,給出了mizumoto型模糊有限狀態(tài)自動(dòng)機(jī)的一種狀態(tài)最小化約簡算法。
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 論文在大規(guī)模事件通知服務(wù)的通用框架基礎(chǔ)上,分別從事件系統(tǒng)的事件模型、時(shí)間模型和觀察模型探討了復(fù)合事件的檢測技術(shù),在傳統(tǒng)的有窮狀態(tài)自動(dòng)機(jī)基礎(chǔ)上擴(kuò)充了時(shí)間模型、參數(shù)化機(jī)制和并發(fā)模型,提出了一種基于自動(dòng)機(jī)的有效復(fù)合事件檢測方法,并將該方法與各種主流方法進(jìn)行了對比分析。