Minimizing state lists for non-deterministic finite state automatons
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Oct 14, 2014
Issued Date -
N/A
app pub date -
Jan 3, 2011
filing date -
Nov 3, 2010
priority date (Note) -
In Force
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully