3. The at least one machine readable medium of claim 1 , wherein when executed, the code causes the at least one processor to: determine whether the state exists in a translation dictionary for the state request, and wherein the state is reproduced if it is not in the dictionary and a new state is added to the dictionary.
1. At least one machine readable medium that includes code for execution and when executed, causes at least one processor to: receive one or more documents and a state request that includes a state, wherein the state in compressed notation is organized into an ordered set with one or more Boolean qualifiers for a bisection lookup, and wherein one or more of the Boolean qualifiers identify whether an element is evaluated using a qualification.