A method for generating a pattern matching machine for identifying matches of a symbol pattern in a sequence of in put symbols, the received symbol pattern including an indicator that one or more symbols in the symbol pattern repeat as repeated symbols, the method comprising: generating a plurality of symbol patterns for the received symbol pattern, each generated symbol pattern being equivalent to the symbol pattern for a different number of repetitions of the repeated symbols, wherein the plurality of generated symbol patterns comprise all possible symbol patterns equivalent to the received symbol pattern up to a predetermined maximum length of a generated symbol pattern.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for generating a pattern matching machine for identifying matches of a symbol pattern in a sequence of input symbols, the received symbol pattern including an indicator that one or more symbols in the symbol pattern repeat as repeated symbols, the method comprising: generating a plurality of symbol patterns for the received symbol pattern, each generated symbol pattern being equivalent to the symbol pattern for a different number of repetitions of the repeated symbols, wherein the plurality of generated symbol patterns comprise all possible symbol patterns equivalent to the received symbol pattern up to a predetermined maximum length of a generated symbol pattern. 2. The method of claim 1 wherein the indicator is a metacharacter in the symbol pattern indicating an iteration. 3. The method of claim 1 further comprising: providing a state machine of states and directed transitions between states corresponding to the generated plurality of patterns such that the state machine includes at least a starting state and additional states, each additional state representing a state in a sequence of pattern symbols for one or more of the generated patterns. 4. The method of claim 3 further comprising: providing, for each state, a failure function for mapping each of one or more states, as a mapped state, to a new state in the state machine, the new state being identified as a state representing a pattern symbol sequence corresponding to a longest proper suffix of the pattern symbol sequence of the mapped state, and the failure function being operable in response to a determination that all directed transitions from the mapped state are not occasioned by an input character in a sequence of input symbols received by the pattern matching machine in use, wherein the new state is identified as the starting state in the absence of a state representing a pattern symbol sequence corresponding to a proper suffix of the pattern symbol sequence of the mapped state. 5. The method of claim 4 wherein at least one pattern includes at least one wildcard symbol, and the failure function for each state representing a pattern symbol sequence including one or more wildcard symbols maps to one or more new states based on one or more input symbols to be received, by the pattern matching machine in use, to constitute each of the one or more wildcard symbols. 6. The method of claim 5 wherein the mapping is provided in a hash table referenced based on a key, the key being based on a unique identifier of the mapped state and the one or more input symbols to be received. 7. A computer implemented method for pattern matching a plurality of symbol patterns in a sequence of input symbols, where at least one symbol pattern includes an indicator that one or more symbols in the symbol pattern repeat as repeated symbols, the method comprising: receiving a pattern matching machine for the plurality of patterns, the pattern matching machine being generated in accordance with the method of claim 1; executing the pattern matching machine for symbols in the sequence of input symbols so as to trigger an output function for sub-sequences of symbols in the sequence of input symbols matching one or more symbol patterns. 8. The method of claim 7 wherein the pattern matching machine is a first pattern matching machine, the method further comprising: providing a second pattern matching machine identical to the first pattern matching machine; and dividing the sequence of input symbols into multiple clusters, wherein the first pattern matching machine is executed for a first cluster in the multiple clusters, and the second pattern matching machine is executed for a second cluster in the multiple clusters, and wherein the first and second clusters include a subsequence of the sequence of input symbols, the first and second clusters overlapping such that a number of symbols at the end of the first cluster is also found at the beginning of the second cluster, the number of symbols being determined based on the predetermined maximum length of a generated symbol pattern so as to provide for parallel matching of the one or more symbol patterns. 9. A pattern matching machine generator for generating a pattern matching machine for identifying matches of a symbol pattern in a sequence of input symbols, the received symbol pattern including an indicator that one or more symbols in the symbol pattern repeat as repeated symbols, the pattern matching machine generator comprising: a deterministic variant generator adapted to generating a plurality of symbol patterns for the received symbol pattern, each generated symbol pattern being equivalent to the symbol pattern for a different number of repetitions of the repeated symbols, wherein the plurality of generated symbol patterns comprise all possible symbol patterns equivalent to the received symbol pattern up to a predetermined maximum length of a generated symbol pattern. 10. The pattern matching machine generator of claim 9 wherein the indicator is a metacharacter in the symbol pattern indicating an iteration. 11. The pattern matching machine generator of claim 9 further comprising: a goto function generator component adapted to provide a state machine of states and directed transitions between states corresponding to the generated plurality of patterns such that the state machine includes at least a starting state and additional states, each additional state representing a state in a sequence of pattern symbols for one or more of the generated patterns. 12. The pattern matching machine generator of claim 11 further comprising: a failure function generator component adapted to provide, for each of one or more states, as a mapped state, a failure function mapping the mapped state to a new state in the state machine, the new state being identified as a state representing a pattern symbol sequence corresponding to a longest proper suffix of the pattern symbol sequence of the mapped state, and the failure function being operable in response to a determination that all directed transitions from the mapped state are not occasioned by an input character in a sequence of input symbols received by the pattern matching machine in use, wherein the new state is identified as the starting state in the absence of a state representing a pattern symbol sequence corresponding to a proper suffix of the pattern symbol sequence of the mapped state. 13. The pattern matching machine generator of claim 12 wherein at least one pattern includes at least one wildcard symbol, and the failure function for each state representing a pattern symbol sequence including one or more wildcard symbols maps to one or more new states based on one or more input symbols to be received, by the pattern matching machine in use, to constitute each of the one or more wildcard symbols. 14. The pattern matching machine generator of claim 13 wherein the mapping is provided in a hash table referenced based on a key, the key being based on a unique identifier of the mapped state and the one or more input symbols to be received. 15. A pattern matching machine generated by the pattern matching machine generator of claim 9, the pattern matching machine being adapted to match a plurality of symbol patterns in a sequence of input symbols, where at least one symbol pattern includes an indicator that one or more symbols in the symbol pattern repeat as repeated symbols, wherein the pattern matching machine is executable so as to trigger an output function component of the pattern matching machine for sub-sequences of symbols in the sequence of input symbols matching one or more symbol patterns. 16. A parallel pattern matching machine arrangement comprising a first pattern matching machine in accordance with claim 15, and a second pattern matching machine in accordance with claim 15, wherein the input symbol sequence is divided into multiple clusters, wherein the first pattern matching machine is executed for a first cluster in the multiple clusters, and the second pattern matching machine is executed for a second cluster in the multiple clusters, and wherein the first and second clusters include a subsequence of the sequence of input symbols, the first and second clusters overlapping such that a number of symbols at the end of the first cluster is also found at the beginning of the second cluster, the number of symbols being determined based on the predetermined maximum length of a generated symbol pattern so as to provide for parallel matching of the one or more symbol patterns. 17. A computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the steps of a method as claimed in claim 1.