Method and apparatus for processing finite automata
US9426166B2 · kind B2 · utility
24Cited by
26References
67Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 30, 2013 |
| Grant date | Aug 23, 2016 |
| Priority date | — |
| Expiry date | Oct 5, 2033 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L63/0245
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method and corresponding apparatus for run time processing use a Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA) to find the existence of a pattern in a payload. A subpattern may be selected from each pattern in a set of one or more regular expression patterns based on at least one heuristic. The DFA may be generated from selected subpatterns from all patterns in the set, and at least one NFA may be generated for at least one pattern in the set, optimizing run time performance of the run time processing.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.