6 search results - page 1 / 2 » Efficient Evaluation of Nondeterministic Automata Using Fact... |
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
FPL
2008
Springer
13 years 6 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
VLSISP
2008
13 years 4 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
EDBT
2006
ACM
14 years 4 months ago
2006
ACM
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...