206 search results - page 6 / 42 » Regular Expressions into Finite Automata |
FPL
2008
Springer
13 years 9 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...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
IMSCCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...