From 05ef316c231c1cc1d402db45030e1ceb29ed6fb6 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Fri, 22 May 2015 19:08:43 +0200 Subject: [PATCH] * doc/org/satmin.org: Typo, reported by Joachim. --- doc/org/satmin.org | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/org/satmin.org b/doc/org/satmin.org index 4483e0b06..2bb7a792c 100644 --- a/doc/org/satmin.org +++ b/doc/org/satmin.org @@ -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