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.
新算法由两部分构成：增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。