在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机(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.

youdao

详细介绍了逻辑环的管理和在其上实现网络睡眠的算法，并提出采用有限状态自动机进行网络节点状态和行为的管理。

The management of logic ring and the network sleep algorithm is introduced, and in the end, the finite state automation is proposed to manage the states and behaviors of the network nodes.

youdao

定义了一个扩展的有限状态自动机、一些新的逻辑转换规则，并给出了详细的分析步骤。

We define an extended finite state automaton, some new logic rules and a set of analysis steps.

youdao