Implement Kurshan's "poorman's inclusion test"
Cf. R.P. Kurshan, Complementing Büchi Automata in Polynomia Time, J. of Comp. and Sys. Sc.
The complementation of deterministic automata is already implemented: it corresponds to calling remove_fin() after complementing the acceptance condition. The paper discusses doing this for non-deterministic automata in order to test inclusion. This could be useful, especially in non-Büchi cases, where the determinization procedure will require a degeneralization first.