Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.Sign up
better encoding for parity acceptance #42
I'm implementing some support for generating and recognizing parity acceptance conditions, and I don't like the encoding currently suggested in the specifications:
I would prefer this to be
The two formulas are logically equivalent, but the second
In particular, I have found the latter point to be important in several algorithms. I can think of at least three algorithms in Spot where either I have special cases to handle acceptance with sets that are both used as Inf and Fin, or the algorithm is simply requires disjoint Fin/Inf numbers as a prerequisite. (My typical simple "horror case" is
What do you think? Can I change the parity examples to use the irredundant encoding?
Fine by me. Currently, jhoafparser does not check for the canonical Acceptance expression for parity, I'll add that.
Should we add the canonical expressions for 'min odd' and 'max even' to the format document as well, just to be extra clear what's expected?