您要查找的是不是：
- generalized finite automaton theory 广义有限自动机理论
- The highway toll collector system was researched by using the finite automata theory. 利用有穷自动机理论研究了高速公路收费站的收费系统。
- finite automaton theory [计] 有限自动机理论
- The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
- Optimizing and Software for Automated Toll Collector Based on the Finite Automata Theory 利用自动机理论对收费站收费系统进行设计并实现
- Automaton theory is a basic theory of compile routine for identifying words. 自动机理论是编译程序中单词识别的基本理论。
- So the storage structure of finite automaton should the choosed adjacency lists. 所以，有穷自动机的存储结构最好采用邻接链表来存储。
- finite automata theory 有限自动机理论
- 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. 由于解析自动机的可扩展性,使其具备一定的异常检测能力。
- An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression. 摘要介绍了构造等价于给定正则表达式的简化确定有限自动机(DFA)的算法。
- 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的性能分析、系统测试提供了理论 基础。
- In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this book. 在语言理论，最简单的一类算法就是可以用有限自动机实现的算法，也是本书的主题。
- 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. 通过对有穷自动机理论与动物识别系统进行分析;建立了一个基于动物特征的确定型有穷自动机的模型.
- Based on the matrix model of a finite automata and with the tools of Matrix Theory and Boolean Algebra,a new method for minimizing a finite automata is presented in this paper. 论文基于有限自动机的矩阵模型????并以矩阵理论和布尔代数为工具,给出了一种有限自动机极小化的新方法。
- Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华，NFA到DFA的转变。
- According to the defects of existing intrusion detection technology, the intrusion detection technology based on data parsing and the finite automaton to implement data parsing were proposed. 摘要针对现有入侵检测技术的不足，提出了基于数据解析的入侵检测技术和利用有限自动机实现数据解析的方法。
- Based on the matrix model of a finite automataand with the tools of Matrix Theory and Boolean Algebra,a new method for determining the equivalence between finite automata has been presented in this paper. 该文在有限自动机的矩阵模型表示方法1基础上,采用矩阵理论和布尔代数为工具,提出了一种有限自动机等价判定的新方法。
