但是为了提高效率，最好使用确定性有限自动机。
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).
基于确定性有限自动机（DFA）的多模式匹配算法被广泛用于数据包深度检测系统中。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
例如，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)”的一些算法。
Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机(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)”中编译一组XPath的逻辑。
In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.
应用推荐