Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
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...
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...
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...