complementation of semi-deterministic automata
There are many places where we need to complement automata, for instance to prove equivalence. Currently we just make a distinction between deterministic and non-deterministic (which are then first determinized), but it would make sense to implement simpler (or at least more efficient) complementations for subclasses of non-deterministic automata.
@xblahoud suggests we implement a complemention of semi-deterministic Büchi automata.
We already have a