但是为了提高效率，最好使用确定性有限自动机。
Yet for increased efficiency, it is best to work with deterministic finite automaton.
这样的表用来实现非确定性有限自动机(NFA)。
Such a table is used to implement nondeterministic finite automaton (NFA).
例如，XAUSTXML压缩器将DTD的模式信息转换成一组确定性有限自动机(DFA)，每个DFA对应于DTD中的一个元素。
For example, the XAUST XML compressor converts the schema information of the DTD into a set of deterministic finite automata (DFA), one for each element in the DTD.
如上个月所讨论的，我计划用确定性有限自动机(Deterministic Finite Automaton,DFA)来编译该代理。
As discussed last month, I plan to use Deterministic Finite Automaton (DFA) to compile the proxy.
在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机(Deterministic Finite Automaton或简称dfa)”中编译一组XPath的逻辑。
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)”的一些算法。
Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
基于确定性有限自动机（DFA）的多模式匹配算法被广泛用于数据包深度检测系统中。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
本文通过对并行环境下非确定有限自动机和确定有限自动机的等价性和转换进行研究，详细分析了非确定有限自动机到确定有限自动机的并行转换方法及算法，并以实例给出了其间并行转化的过程。
This paper through to research the equivalence and conversion of NFA and DFA in parallel environment, labor the method of NFA convert to DFA, and give a example of the process of parallel conversion.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
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.
简单介绍了多路自动机的定义，分析了多路自动机和有限自动机的关系，包括确定的有限自动机和非确定的有限自动机，并且给出了例子。
This paper introduces the defination of multiplicity automata and analyzes the relationship of multiplicity automata and deterministic automata or non_deterministic automata.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
为解决此问题，基于非确定有限自动机的特点并针对子集构造法的不足，提出了一种优化的非确定有限自动机确定化算法。
To solve this problem, an optimized algorithm for transition from NFA to DFA is put forward on the basis of characters of NFA and according to shortcomings of the subset. construction method.
“因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念，被证明是(计算理论科学研究中的)一个非常重要的概念。
For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
“因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念，被证明是(计算理论科学研究中的)一个非常重要的概念。
For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
应用推荐