a simple acceptance set simplification
Assume two acceptance sets 0
and 1
are complementary.
If the acceptance condition as a clause such as Fin(0) & Inf(1)
, then set 1
can be removed and the acceptance reduced to Fin(0)
because visiting 0
finitely often will imply that part of the complement of 0
will be seen infinitely often.
For this and other similar simplifications, it would be useful to represent acceptance sets as bit vectors of the states/edges they contain.