19. The computer of claim 15 , wherein unrolling the identified portions includes the processor to: determine that the identified portions match a multiple numbers of loops including at least a first number and a second number; create a first new quantification of the first number minus one; create a second new quantification with a ranged between one and the second number minus the first number plus one; and concatenate the result of repeating a sub-expression of the first new quantification for the first number minus one times to an unrolling of the second new quantification.
19. The computer of claim 15 , wherein unrolling the identified portions includes the processor to: determine that the identified portions match a multiple numbers of loops including at least a first number and a second number; create a first new quantification of the first number minus one; create a second new quantification with a ranged between one and the second number minus the first number plus one; and concatenate the result of repeating a sub-expression of the first new quantification for the first number minus one times to an unrolling of the second new quantification. 20. The computer of claim 19 , wherein unrolling the second new quantification includes splitting the second new quantification based on a threshold transitions states to members of the split, the threshold denoting in-degree or out-degree transitions of an automaton.