您要查找的是不是：
- An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression. 摘要介绍了构造等价于给定正则表达式的简化确定有限自动机(DFA)的算法。
- A non-deterministic finite automaton (NFA) can be constructed by linking two deterministic finite automata (DFAs). 通过两台确定型有穷自动机(DFA)的连接，构造一台非确定型有穷自动机(NFA)。
- deterministic finite automaton (DFA) 确定有限自动机
- non deterministic finite automaton 非确定性有限自动机
- two-way deterministic finite automaton 双向确定型有限自动机
- By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established. 通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特徵的确定型有穷自动机的模型。
- By analyzing the theory of Deterministic Finite Automata(DFA)and ARS, a DFA model based on animal character is established. 通过对有穷自动机理论与动物识别系统进行分析;建立了一个基于动物特征的确定型有穷自动机的模型.
- If you haven't done a lot of work with these topics, be prepared to learn a whole slew of new termonolgy and concepts: deterministic finite automata, finite state automata, LR parsing, and more. 如果你对这些东西还没有足够的了解的话，那么你就要准备去学习一些新的术语和概念，比如确定性有限自动机，有限状态自动机，LR剖析器等等。
- deterministic finite automaton 决定性有限自动机,确定的有穷自动机
- Learning of Deterministic Finite Automata at Exact Learning Model 精确学习模型下确定的有穷自动机的学习
- The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
- So the storage structure of finite automaton should the choosed adjacency lists. 所以，有穷自动机的存储结构最好采用邻接链表来存储。
- Therefore the finite automaton cannot accept the evolution languages generated by elementary cellular automaton of rule 122. 结果表明:仅用有限自动机是无法接受由122号初等元胞自动机产生的演化语言。
- For a nondeterministic finite automaton (NFA), a new input may cause the machine to be in more than one state, hence its non-determinism. 对于非确定有限自动机 (NFA)，一个新输入可以导致机器进入多于一个状态，因此是非确定性的。
- Because of the scalability of finite automaton,the intrusion detection system was made to be of certain anomaly detection capabilities. 由于解析自动机的可扩展性,使其具备一定的异常检测能力。
- The NFA (Non-deterministic Finite Automaton) model of GECISM accurately describes this system and meanwhile is the basement of performance analysis and system test about GECISM. GECISM的NFA(Non-deterministic Finite Automaton )模型精确定义了GECISM的属性和特征,为GECISM的性能分析、系统测试提供了理论 基础。
- For every NFA a deterministic finite state machine (DFA) can be found that accepts the same language. 保持机器当前可能处在的所有状态的集合数据结构。
- acyclic deterministic fuzzy finite automaton 非循环确定模糊自动机
- Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华，NFA到DFA的转变。
- Deterministic finite automata 确定有限自动机
