Commit 1eb0464a authored by Alexandre Duret-Lutz's avatar Alexandre Duret-Lutz
Browse files

* bench/wdba/README: Typos.

parent 290b825a
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.
......
......@@ -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
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment