您要查找的是不是：
- A non-deterministic finite automaton (NFA) can be constructed by linking two deterministic finite automata (DFAs). 通过两台确定型有穷自动机(DFA)的连接，构造一台非确定型有穷自动机(NFA)。
- 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. 通过对有穷自动机理论与动物识别系统进行分析;建立了一个基于动物特征的确定型有穷自动机的模型.
- An algorithm for constructing the simplified DFA (Deterministic Finite Automaton) is introduced, which is equivalent to a given regular expression. 摘要介绍了构造等价于给定正则表达式的简化确定有限自动机(DFA)的算法。
- 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 (DFA) 确定有限自动机
- non deterministic finite automaton 非确定性有限自动机
- two-way deterministic finite automaton 双向确定型有限自动机
- Learning of Deterministic Finite Automata at Exact Learning Model 精确学习模型下确定的有穷自动机的学习
- Deterministic finite automata 确定有限自动机
- Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华，NFA到DFA的转变。
- deterministic finite automaton 决定性有限自动机,确定的有穷自动机
- In this paper it introduces an approach to compress and code gray image using deterministic Generalized Finite Automata(GFA). 提出一种用确定性的广义有限自动机(GFA)对灰度图像进行压缩编码的方法。
- The decoding algorithm can restore image from deterministic Generalized Finite Automata efficiently,and the regenerated images have no obvious blocking effect. 解码算法可以非常高效的由确定的广义有限自动机复原图像,且结果图像没有很明显的方块效应。
- The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
- The cab signal fault diagnosis problem is combined with the pattern matching problem on the ba-sis of this conclusion. A cab signal fault diagnosis model based on Multiple Patterns Matching Algorithm DFSA(Deterministic Finite State Automata) is proposed. 并在此基础上将模式匹配问题与机车信号的故障诊断问题相结合,提出了基于多模式匹配算法DFSA(Deterministic Finite State Automata)的机车信号故障诊断模型。
- So the storage structure of finite automaton should the choosed adjacency lists. 所以，有穷自动机的存储结构最好采用邻接链表来存储。
- In 1985, the finite automaton public key cryptosystem was proposed. It stimulates the investigation of invertibility of finite automata. 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.
- The highway toll collector system was researched by using the finite automata theory. 利用有穷自动机理论研究了高速公路收费站的收费系统。
- The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
