发明授权
US08862603B1 Minimizing state lists for non-deterministic finite state automatons 有权
最小化非确定性有限状态自动机的状态列表

Minimizing state lists for non-deterministic finite state automatons
摘要:
A method and apparatus are disclosed for determining whether an input string of characters matches a pattern. The pattern has the form of an activator expression, a counter expression, and a tail. The method involves monitoring one or more active states associated with the pattern, and comparing each character to the activator expression and the counter expression for each of the one or more active states. An input character match to the activator expression comprises an activator match, and a character match to the counter expression without matching the activator expression comprises a non-activator match. The number of one or more active states corresponds to the number of non-activator to activator character transitions between adjacent received matching characters.
信息查询
0/0