finite state automata

常见例句

Model checking is a formal verification by exhaustive search to finite state automata.
模型檢測是基於對有窮狀態自動機進行窮盡搜索的一種形式化騐証方法。
In chapter two, the basic knowledges of finite state automata and finite homogeneous Markov chain are introduce.
第二章，介紹有限狀態自動機、有限齊次馬爾可夫鏈及隨機系統的基礎知識。
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.
新算法由兩部分搆成：增加模糊字符串到最小非循環確定模糊自動機和最小化增加模糊字符串後得到的自動機。