|
Class Summary |
| DPTable |
Class DPTable maintains a representation of the state of a dynamic
programming table for the lcs problem. |
| GenFn |
Class GenFn computes approximations to a function λ(z) to
be used in Theorem 3.3, for a specified transition function file,
and then computes the corresponding bounds on γ. |
| State |
Instances of class State hold the four (short) integers
x,y,dx,dy representing a state of the automaton
described in Section 3.2. |
| StateTable |
Class StateTable gives a representation of the set of reachable
states with a given history length. |