finite state automata

基本解釋

Model checking is a formal verification by exhaustive search to finite state automata.
模型檢測(cè)是基于對(duì)有窮狀態(tài)自動(dòng)機(jī)進(jìn)行窮盡搜索的一種形式化驗(yàn)證方法。
In chapter two, the basic knowledges of finite state automata and finite homogeneous Markov chain are introduce.
第二章，介紹有限狀態(tài)自動(dòng)機(jī)、有限齊次馬爾可夫鏈及隨機(jī)系統(tǒng)的基礎(chǔ)知識(shí)。
The new algorithm is composed of two parts: adding fuzzy strings to minimal acyclic deterministic fuzzy finite state automata (ADFFAs) and minimizing the resulting automata.
新算法由兩部分構(gòu)成：增加模糊字符串到最小非循環(huán)確定模糊自動(dòng)機(jī)和最小化增加模糊字符串后得到的自動(dòng)機(jī)。

finite -state automata 有限狀態(tài)自動(dòng)機(jī)
Nondeterministic Finite -state Automata 非確定有限狀態(tài)機(jī)
probabilistic finite -state automata 概率有限自動(dòng)機(jī)
deterministic finite state automata [自]確定性有限狀態(tài)自動(dòng)機(jī);自動(dòng)機(jī);確定性有限狀態(tài)自動(dòng)機(jī)
Cascade Finite State Automata 層式有限狀態(tài)自動(dòng)機(jī)

有限自動(dòng)機(jī)
We present a shot boundary detection framework with collaboration of multiple detectors. A motion vector and finite state automata based algorithm for robust detection of gradual transition is also proposed.
本文提出了一個(gè)多檢測(cè)器協(xié)同工作的鏡頭邊界檢測(cè)框架,包括一種基于運(yùn)動(dòng)向量和有限自動(dòng)機(jī)的魯棒的漸變檢測(cè)算法,評(píng)測(cè)結(jié)果表明該框架具有很好的檢測(cè)效果。
有限狀態(tài)自動(dòng)機(jī)