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

* bench/wdba/README: Typos.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2011-05-30 09:11:40 +02:00
parent 290b825a3a
commit 1eb0464afc
2 changed files with 7 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

4
ChangeLog
View file

@ -1,3 +1,7 @@
2011-05-30 Alexandre Duret-Lutz <adl@lrde.epita.fr>
* bench/wdba/README: Typos.
2011-05-18 Alexandre Duret-Lutz <adl@lrde.epita.fr>
Some intvcomp2 speedups.

6
bench/wdba/README
View file

@ -84,10 +84,10 @@ for two sub-transitions labelled by "p&q" and "p&!q". So we are
counting it as two transitions.
You can observe that some minimized automata have more transitions:
this is because their structure changed when they where determinized.
this is because their structure changed when they were determinized.
Even though they have the same number of states as the non-minimized
automaton, the states do not accept the same language. There is even
one case (formula 36) where the minimized automaton got one more
automaton, their states do not accept the same languages. There is
even one case (formula 36) where the minimized automaton got one more
state.
In two cases (formulae 31 and 35) the minimization actually removed