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

有限自动机
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.
本文提出了一个多检测器协同工作的镜头边界检测框架,包括一种基于运动向量和有限自动机的鲁棒的渐变检测算法,评测结果表明该框架具有很好的检测效果。
有限状态自动机