  We consider the reachability problem on transition systems corresponding to
succinct one-counter machines, that is, machines where the counter is
incremented or decremented by a value given in binary.
