  We present here a more general version of the balanced pair algorithm. This
version works in the reducible case and terminates more often than the standard
algorithm. We present examples to illustrate this point. Lastly, we discuss the
features which lead to balanced pair algorithms not terminating and state
several conjectures.
