16. The computer of claim 15 , wherein to rewrite the quantification to be implemented by the counter state machine element includes putting a portion of the quantification into the form of a sub-expression and a range, the range including a first threshold denoting a minimum repetition of the sub-expression and a second threshold denoting a maximum repetition of the sub-expression, the first threshold being greater than zero and the second threshold being greater than or equal to the first threshold.
16. The computer of claim 15 , wherein to rewrite the quantification to be implemented by the counter state machine element includes putting a portion of the quantification into the form of a sub-expression and a range, the range including a first threshold denoting a minimum repetition of the sub-expression and a second threshold denoting a maximum repetition of the sub-expression, the first threshold being greater than zero and the second threshold being greater than or equal to the first threshold. 17. The computer of claim 16 , wherein to rewrite the quantification includes splitting the quantification into a first portion that is bounded by the first threshold and the second threshold, and a second portion that is unbounded in at least one of the minimum repetition or the maximum repetition for a second sub-expression, wherein combining the first portion and the second portion matches the same pattern as the quantification.