63 search results - page 1 / 13 » Minimizing NFA's and Regular Expressions |
ARC
2011
Springer
12 years 11 months ago
2011
Springer
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
IMSCCS
2006
IEEE
13 years 10 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...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
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...
ACMSE
2006
ACM
13 years 10 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...