* doc/org/satmin.org: Typo, reported by Joachim.

This commit is contained in:
Alexandre Duret-Lutz 2015-05-22 19:08:43 +02:00
parent 7b5c37d5a5
commit 05ef316c23

View file

@ -558,7 +558,7 @@ SAT-based minimization algorithm will look for automata that have
fewer states than the original automaton (after preliminary
simplifications). This is not always reasonable. For instance
constructing a Streett automaton from a Rabin automaton might require
more states. An upper bound on the number of state be passed
more states. An upper bound on the number of state can be passed
using a =max-states=123= argument to =--sat-minimize=.
If the input automaton is transition-based, but option =-S= is used to