全部

1·Can DFA regex engines handle atomic groups?

DFA的正则表达式引擎可以处理原子团？

2·How do I prove a DFA has no synchronizing word?

我如何证明一个DFA没有同步字？

3·The DFAFactory class compiles a DFA from the parse tree.

DFAFactory类从该解析树编译dfa。

4·If anything, this is less efficient than maintaining only one DFA.

如果有什么不同的话，那就是这要比只维护一个DFA的效率差。

5·Two related elements come into play when constructing the DFA.

当构造DF A时，两个相关元素发挥了作用。

6·Therefore it does not know which method to call when the DFA matches.

因此，它不知道在dfa匹配时要调用哪个方法。

7·Can a DFA state have two arrows pointing to it with the same value?

可以DF A状态有两个箭头指向相同的价值吗？

8·Recall from our discussion last month that a DFA is a transition diagram.

回忆上个月我们所讨论的，DFA是一个转换图。

9·This is the most simple DFA realized, when used to modify file paths!

这是最简单的DFA实现，使用时注意修改文件路径！

10·The number of states grows when the DFA attempts to recognize more XPaths.

当 DFA 试图识别更多的 XPath 时，状态的数量也会随之增长。