大学英语词汇短语释义解析及例句 finite automaton
释义：
finite automaton [自] 有限自动机
例句：
Such a table is used to implement nondeterministic finite automaton (NFA).
这样的表用来实现非确定性有限自动机(NFA)。
The result shows that the finite automaton can accept this limit set.
结果表明：用有限自动机就可以接收该极限语言。
Yet for increased efficiency, it is best to work with deterministic finite automaton.
但是为了提高效率，最好使用确定性有限自动机。
As discussed last month, I plan to use Deterministic Finite Automaton (DFA) to compile the proxy.
如上个月所讨论的，我计划用确定性有限自动机(Deterministic Finite Automaton,DFA)来编译该代理。
The finite automaton model is used in text processing, compilers, hardware design and the like.
其中的有限自动机模型在文本处理、编译程序以及硬件设计等等中非常有用。
In this paper we discuss one public key cryptosystem which based on the theory of the finite automaton.
该文讨论的是基于有限自动机理论的公钥加密体制。
In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.
在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机(Deterministic Finite Automaton或简称dfa)”中编译一组XPath的逻辑。
Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
讲得更具体些，在上篇专栏文章中，我回顾了编译所谓“确定性有限自动机(Deterministic Finite Automaton，简称dfa)”的一些算法。
A finite automaton (FA) was used to build up the shallow water ray tracing model, and the model state, transition, event and action were analyzed.
用有穷状态自动机对浅海的声线追踪建模，给出了浅海声线追踪内在的状态及状态转移分析。
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
In this paper, a simple biomolecular pushdown automaton is constructed with a finite automaton and a pushdown store firstly, and an algorithm is designed to solve a kind of languages.
文中首先通过在分子有限自动机上扩展一个分子下推存储器从而获得了一种简单的分子下推自动机，并基于该下推自动机提出了一类语言的分子自动机解法。
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
