alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

* NEWS: Fix some typos.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2019-07-05 22:43:04 +02:00
parent bfe0ada634
commit d244ff5432
1 changed files with 5 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

9
NEWS
View file

@ -27,7 +27,7 @@ New in spot 2.7.5.dev (not yet released)
- Due to some new simplification of parity acceptance, the output of - Due to some new simplification of parity acceptance, the output of
"ltl2tgba -P -D" is now using a minimal number of colors. This "ltl2tgba -P -D" is now using a minimal number of colors. This
means that recurrence properties have an acceptance condition means that recurrence properties have an acceptance condition
amongst "Inf(0)", "t", or "f", and persistance properties have an among "Inf(0)", "t", or "f", and persistance properties have an
acceptance condition among "Fin(0)", "t", or "f". acceptance condition among "Fin(0)", "t", or "f".
Documentation: Documentation:
@ -72,9 +72,10 @@ New in spot 2.7.5.dev (not yet released)
helpful to display automata as "graphs", e.g., when illustrating helpful to display automata as "graphs", e.g., when illustrating
algorithms that do not care about labels. algorithms that do not care about labels.
- A new complement() function returns complementd automata with - A new complement() function returns complemented automata with
unspecified acceptance condition. The output can be alternating unspecified acceptance condition, allowing different algorithms to
only if the input was alternating. be used. The output can be alternating only if the input was
alternating.
- There is a new class output_aborter that is used to specify - There is a new class output_aborter that is used to specify
upper bounds on the size of automata produced by some algorithms. upper bounds on the size of automata produced by some algorithms.