您要查找的是不是：
- Functions of Zero State of Linear Finite Automata 线性有限自动机零状态的作用
- quasi-order memory linear finite automata 拟存贮有限自动机
- linear finite automaton 线性有限自动机
- The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
- So the storage structure of finite automaton should the choosed adjacency lists. 所以，有穷自动机的存储结构最好采用邻接链表来存储。
- linear finite autonomous automaton 线性有限内动机
- linear finite automata 线性有限自动机
- 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 stability of dissolving cavity for the low depth thin layer rock salt has been researched by the ADINA non linear finite element method. 为了延长盐矿井的寿命,避免开采带来的地面沉陷,并合理利用形成的溶腔,必须探讨岩盐水溶开采过程中影响溶腔稳定性的因素,以便即时采取有效的防治措施。
- 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的性能分析、系统测试提供了理论 基础。
- The linear finite difference equations were solved to evaluate the carrying capacity of point-supported insulating glass units. 通过线性有限差分方程,研究点支式中空玻璃外内片承载比例等承载性能。
- 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. 摘要针对现有入侵检测技术的不足，提出了基于数据解析的入侵检测技术和利用有限自动机实现数据解析的方法。
- In 1985, the finite automaton public key cryptosystem was proposed. It stimulates the investigation of invertibility of finite automata. 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.
- 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. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
- non- linear finite element method 非线性有限元
