发明名称 |
POSITIONALLY DEPENDENT PATTERN CHECKING IN CHARACTER STRINGS USING DETERMINISTIC FINITE AUTOMATA |
摘要 |
An apparatus including logic to receive a data packet comprising a string of characters, said apparatus having a plurality of states and at least one state for every character position in the string of characters; logic to examine the string of characters for matches with a plurality of predefined values, beginning with an initial character; and logic to execute forward exit transitions from any of the plurality of states based upon the examination of the characters, wherein a current state of the apparatus represents a count of a number of characters from the initial character of the string of characters.
|
申请公布号 |
US2012084245(A1) |
申请公布日期 |
2012.04.05 |
申请号 |
US201113252776 |
申请日期 |
2011.10.04 |
申请人 |
LAW DAVID;FURLONG PETER;O'NEILL EUGENE;LOUGHRAN KEVIN |
发明人 |
LAW DAVID;FURLONG PETER;O'NEILL EUGENE;LOUGHRAN KEVIN |
分类号 |
G06N5/02 |
主分类号 |
G06N5/02 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|