6. An apparatus for matching regular expressions including word boundary symbols comprising: a memory storing a module comprising machine readable instructions to: receive an input string; receive a regular expression including a word or non-word boundary symbol; and transform the regular expression into an automaton such that a set of strings accepted by the automaton is the same as a set of strings described by the regular expression, wherein the automaton is a final automaton derived from a plurality of intermediate automata, and wherein transforming the regular expression into the final automaton further includes transforming the regular expression into a first intermediate automaton that accepts a string over an extended alphabet including word and non-word boundary symbols; and a processor to implement the module.
6. An apparatus for matching regular expressions including word boundary symbols comprising: a memory storing a module comprising machine readable instructions to: receive an input string; receive a regular expression including a word or non-word boundary symbol; and transform the regular expression into an automaton such that a set of strings accepted by the automaton is the same as a set of strings described by the regular expression, wherein the automaton is a final automaton derived from a plurality of intermediate automata, and wherein transforming the regular expression into the final automaton further includes transforming the regular expression into a first intermediate automaton that accepts a string over an extended alphabet including word and non-word boundary symbols; and a processor to implement the module. 7. The apparatus of claim 6 , further comprising machine readable instructions to: process the input string by the automaton to determine if the input string matches the regular expression.