首页>
外国专利>
Parallelized pattern matching using non-deterministic finite automata
Parallelized pattern matching using non-deterministic finite automata
展开▼
机译:使用不确定性有限自动机的并行模式匹配
展开▼
页面导航
摘要
著录项
相似文献
摘要
This disclosure describes techniques of determining whether a symbol stream includes a pattern defined by a regular expression. As described herein, the regular expression may be represented using a non-deterministic finite automaton (NFA). A plurality of states in the NFA may be evaluated in parallel. These states may be associated with a plurality of symbol positions in a symbol stream. Evaluating a plurality of states and symbols in parallel may allow for faster determinations of whether the symbol stream includes the pattern defined by the regular expression.
展开▼