This means that the old implementation of Pager's algorithm
is replaced with the new one; as a result, the automata that
are produced can have either more states or fewer states.
The construction can be up to 2x slower.
In canonical mode, the automata that are produced should be
unchanged, up to the numbering of states; the construction
should be about 2x faster.
This closes issue #21.