diff --git a/ChangeLog b/ChangeLog index 068a50aa9..62ce6ebaf 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,7 @@ +2009-02-23 Alexandre Duret-Lutz + + * src/tgba/tgba.hh: Typos. + 2009-02-18 Alexandre Duret-Lutz * src/tgba/succiterconcrete.cc (tgba_succ_iterator_concrete::next): diff --git a/src/tgba/tgba.hh b/src/tgba/tgba.hh index 78b12d921..0b56804e2 100644 --- a/src/tgba/tgba.hh +++ b/src/tgba/tgba.hh @@ -52,12 +52,12 @@ namespace spot /// TGBAs are transition-based, meanings their labels are put /// on arcs, not on nodes. They use Generalized Büchi acceptance /// conditions: there are several acceptance sets (of - /// transitions), and a path can be accepted only if it traverse + /// transitions), and a path can be accepted only if it traverses /// at least one transition of each set infinitely often. /// - /// Browsing such automaton can be achieved using two functions. + /// Browsing such automaton can be achieved using two functions: /// \c get_init_state, and \c succ_iter. The former returns - /// the initial state while the latter allows to explore the + /// the initial state while the latter lists the /// successor states of any state. /// /// Note that although this is a transition-based automata,