DFA
英[]
美[]
- abbr. 美术博士(Doctor of Fine Art)
双语例句
- 1. Can DFA regex engines handle atomic groups?
- DFA的正则表达式引擎可以处理原子团?
youdao
- 2. How do I prove a DFA has no synchronizing word?
- 我如何证明一个DFA没有同步字?
youdao
- 3. The DFAFactory class compiles a DFA from the parse tree.
- DFAFactory类从该解析树编译dfa。
youdao
- 4. If anything, this is less efficient than maintaining only one DFA.
- 如果有什么不同的话,那就是这要比只维护一个DFA的效率差。
youdao
- 5. Two related elements come into play when constructing the DFA.
- 当构造DF A时,两个相关元素发挥了作用。
youdao
- 6. Therefore it does not know which method to call when the DFA matches.
- 因此,它不知道在dfa匹配时要调用哪个方法。
youdao
- 7. Can a DFA state have two arrows pointing to it with the same value?
- 可以DFA状态有两个箭头指向相同的价值吗?
youdao
- 8. Recall from our discussion last month that a DFA is a transition diagram.
- 回忆上个月我们所讨论的,DFA是一个转换图。
youdao
- 9. This is the most simple DFA realized, when used to modify file paths!
- 这是最简单的DFA实现,使用时注意修改文件路径!
youdao
- 10. In the empirical tests, we found that the DFA model still has some bugs.
- 在实证测试中,我们发现该模型仍然存在一些错误。
youdao
- 11. The number of states grows when the DFA attempts to recognize more XPaths.
- 当DFA试图识别更多的XPath 时,状态的数量也会随之增长。
youdao
- 12. As you will see, it is possible to automatically convert an NFA into a DFA.
- 正如您将看到的,有可能自动地将NF A转换成dfa。
youdao
- 13. If you have a copy of the book handy, the DFA construction is algorithm 3.5.
- 如果您手边有这本书,那么这个dfa构造使用的是这本书中所讲的算法3.5。
youdao
- 14. To test the DFA construction, I had to simulate the proxy and the front end.
- 为了测试DF A构造,我必须模拟代理和前端。
youdao
- 15. I need to finalize the DFA compilation before I have anything new worth Posting.
- 在值得张贴一些新东西之前,我需要最终处理dfa编译。
youdao
- 16. move() returns the state the DFA transitions to upon hitting a given XML element.
- 一旦命中给定的XML元素,move()返回DFA转换的状态。
youdao
- 17. The DFA is a popular algorithm to construct a state machine to recognize patterns.
- DFA是一个深受大家喜爱的算法,用来构造一个状态机来识别模式。
youdao
- 18. As discussed last month, I plan to use Deterministic Finite Automaton (DFA) to compile the proxy.
- 如上个月所讨论的,我计划用确定性有限自动机(Deterministic Finite Automaton,DFA)来编译该代理。
youdao
- 19. CreateDFA is a direct implementation of the DFA construction algorithm discussed in the previous column.
- createDFA是以前专栏文章中所讨论过的DF a构造算法的直接实现。
youdao
- 20. Finally, we present the application of car drive panel assembly by use of DFA in concurrent engineering.
- 介绍了在并行工程理念下d FA技术在轿车驾驶舱装配开发中的应用。
youdao
- 21. The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.
- 如前一篇专栏文章中所解释的,DF A构造算法将该解析树转换成一组状态。
youdao
- 22. A constructive minimization algorithm of DFA easy to be implemented is presented based on the above discussion.
- 基于上述理论分析,给出了DFA最小化算法的一个容易实现的构造性描述及示例。
youdao
- 23. 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的逻辑。
youdao
- 24. Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).
- 讲得更具体些,在上篇专栏文章中,我回顾了编译所谓“确定性有限自动机(Deterministic Finite Automaton,简称dfa)”的一些算法。
youdao
- 25. Without repeating the discussion from that column, a DFA is a structure to which XPaths can be compiled efficiently.
- 不必重复那篇专栏文章所讨论的内容,DFA是可以高效编译XPath的结构。
youdao
- 26. Deciding what to do when matching an XPath and how to assign priorities is not the responsibility of the DFA compiler.
- 当匹配XPath时,DF a编译器是不负责确定要做什么以及如何分配优先级这些事。
youdao
- 27. From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.
- 从上一篇专栏文章所讨论的内容中,您可以回忆起,构造DFA的算法需要一棵解析树作为输入。
youdao
- 28. Most of the development work for this column has been in implementing the DFA construction algorithm introduced last month.
- 这篇专栏文章中所涉及的大多数开发工作都是在实现上月所介绍的DF A构造算法。
youdao
- 29. The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
- 基于确定性有限自动机(DFA)的多模式匹配算法被广泛用于数据包深度检测系统中。
youdao
- 30. By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established.
- 通过对有穷自动机理论与动物识别系统进行分析,建立了一个基于动物特征的确定型有穷自动机的模型。
youdao
百度翻译
有道翻译