10. The method as claimed in claim 9 , further comprising deriving a corresponding finite automaton from the regular grammar used for the shortening operation.
9. The method as claimed in claim 8 , wherein recognized patterns are shortened by at least one regular grammar rule.