From 6e4110fabb7731d13c331ca9389d03a0f4e2b4f8 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Wed, 18 Feb 2009 09:59:41 +0100 Subject: [PATCH] Typos --- ChangeLog | 5 +++++ src/tgba/succiterconcrete.cc | 8 ++++---- 2 files changed, 9 insertions(+), 4 deletions(-) diff --git a/ChangeLog b/ChangeLog index 744be128b..068a50aa9 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,8 @@ +2009-02-18 Alexandre Duret-Lutz + + * src/tgba/succiterconcrete.cc (tgba_succ_iterator_concrete::next): + Typos. + 2008-12-17 Guillaume SADEGH Update to compile with GCC 4.4.0 (trunk). diff --git a/src/tgba/succiterconcrete.cc b/src/tgba/succiterconcrete.cc index d2970c76f..690c1e54e 100644 --- a/src/tgba/succiterconcrete.cc +++ b/src/tgba/succiterconcrete.cc @@ -1,4 +1,4 @@ -// Copyright (C) 2003 Laboratoire d'Informatique de Paris 6 (LIP6), +// Copyright (C) 2003, 2009 Laboratoire d'Informatique de Paris 6 (LIP6), // département Systèmes Répartis Coopératifs (SRC), Université Pierre // et Marie Curie. // @@ -51,9 +51,9 @@ namespace spot { assert(!done()); // succ_set_ is the set of successors we have to explore. it - // contains Now/Next variable and atomic propositions. Each + // contains Now/Next variables and atomic propositions. Each // satisfaction of succ_set_ represents a transition, and we want - // to compute as little transitions as possible. However one + // to compute as few transitions as possible. However one // important constraint is that all Next variables must appear in // the satisfaction. // @@ -75,7 +75,7 @@ namespace spot // acceptance conditions. // Let's label transitions with hypothetic acceptance sets: // a & b & Next[a] & Next[b] ; Acc[1] - // !a & b & Next[a] & Next[b] ; Acc[2] + // !a & b & Next[a] & Next[b] ; Acc[1] // a & !b & Next[a] & Next[b] ; Acc[2] // a & b & Next[a] & !Next[b] ; Acc[1] // Now it's pretty clear only the first two transitions