alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

typos

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2009-02-23 15:05:52 +01:00
parent 6e4110fabb
commit ab8b2cbceb
2 changed files with 7 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
src/tgba/tgba.hh
View file

@ -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,