您要查找的是不是：
- minimum state finite automaton 最小状态有限自动机
- 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)，一个新输入可以导致机器进入多于一个状态，因此是非确定性的。
- 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号初等元胞自动机产生的演化语言。
- He wished to preserve as much liberty as possible, while recognising that the minimum state was unacceptable to a democratic society with an urbanised economy. 他希望保留尽可能高的自由度，同时也认识到，对于经济城市化的民主社会，政府只拥有最低限度的权力是不可接受的。
- 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的性能分析、系统测试提供了理论 基础。
- 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. 摘要针对现有入侵检测技术的不足，提出了基于数据解析的入侵检测技术和利用有限自动机实现数据解析的方法。
- Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. 简单DFA有穷自动机，可以根据输入的状态转换表，进行状态转换，对输入的字符串判断，该自动机是否可以接受。
- In 1985, the finite automaton public key cryptosystem was proposed. It stimulates the investigation of invertibility of finite automata. 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.
- limit state finite element method 极限分析法
- A non-deterministic finite automaton (NFA) can be constructed by linking two deterministic finite automata (DFAs). 通过两台确定型有穷自动机(DFA)的连接，构造一台非确定型有穷自动机(NFA)。
- The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
- 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剖析器等等。
- Analyzing Arbitrary Scale Counter by Means of "Minimum State and Maximum State" 用"最小状态、最大状态"法分析任意进制计数器
- Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata. 摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。
- We have pared down our expenses to a bare minimum. 我们已最大限度地削减了开支。
