摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
为解决此问题，基于非确定有限自动机的特点并针对子集构造法的不足，提出了一种优化的非确定有限自动机确定化算法。
To solve this problem, an optimized algorithm for transition from NFA to DFA is put forward on the basis of characters of NFA and according to shortcomings of the subset. construction method.
另外也可以使用XPath构造创建xml节点树的过滤子集并将其返回给调用方。
An alternative is to use XPath constructs to create filtered subsets of the XML node tree and return them to the caller.
应用推荐