1.(=Doctor of Fine Arts)美术博士
1.(=Doctor of Fine Arts)
1.Therefore it does not know which method to call when the DFA matches.
因此，它不知道在DFA匹配时要调用哪个方法。
2.As you will see, it is possible to automatically convert an NFA into a DFA.
正如您将看到的，有可能自动地将NFA转换成DFA。
3.The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.
如前一篇专栏文章中所解释的，DFA构造算法将该解析树转换成一组状态。
4.Without repeating the discussion from that column, a DFA is a structure to which XPaths can be compiled efficiently.
不必重复那篇专栏文章所讨论的内容，DFA是可以高效编译XPath的结构。
5.In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.
在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机（DeterministicFiniteAutomaton或简称DFA）”中编译一组XPath的逻辑。
6.Assembly planning is one of the key technologies for virtual manufacturing and design for assembly (DFA).
装配规划是虚拟装配和面向装配设计的关键技术之一。
7.DFA - 2 speed wind table is a measure of average wind speed instrument, mainly used for coal mine average wind velocity measurement.
2中速风表是测量平均风速的仪表，主要用于煤矿井下平均风速的测量。
8.However, it is possible to prove that any NFA is reducible to an equivalent DFA.
不过，可以证明，任何新四军是还原相当于装配。
9.The most common algorithm to process transition diagrams is to convert them in a deterministic finite automaton (DFA).
处理转换图的最常见算法是在确定性有限自动机（DFA）中转换它们。
10.Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
讲得更具体些，在上篇专栏文章中，我回顾了编译所谓“确定性有限自动机（DeterministicFiniteAutomaton，简称DFA）”的一些算法。