Hybrid representation for deterministic finite automata
US8261352B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 19, 2009 |
| Grant date | Sep 4, 2012 |
| Priority date | — |
| Expiry date | Apr 30, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L63/1416
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method includes receiving a data unit, determining whether a current state, associated with a deterministic finite automata (DFA) that includes a portion of states in a bitmap and a remaining portion of states in a DFA table, is a bitmap state or not, and determining whether a value corresponding to the data unit is greater than a threshold value, when it is determined that the current state is not a bitmap state. The method further includes determining whether the current state is insensitive, when it is determined that the value corresponding to the data unit is greater than the threshold value, where insensitive means that each next state is a same state for the current state, and selecting a default state, as a next state for the current, when it is determined that the current state is insensitive.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.