644 search results - page 103 / 129 » Precedence Automata and Languages |
FPL
2008
Springer
13 years 10 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...
DLT
2003
13 years 10 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
VLSISP
2008
13 years 8 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...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
SIGADA
2007
Springer
14 years 2 months ago
2007
Springer
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...