Minimizing state lists for non-deterministic finite state automatons
US8862603B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 3, 2011 |
| Grant date | Oct 14, 2014 |
| Priority date | — |
| Expiry date | Oct 26, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/425
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.