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

* src/tgbaalgos/lbtt.hh: Typos.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2004-02-05 18:44:09 +00:00
parent b253881336
commit 0816a4505f
2 changed files with 6 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

2
ChangeLog
View file

@ -1,5 +1,7 @@
2004-02-05 Alexandre Duret-Lutz <adl@src.lip6.fr> 2004-02-05 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/tgbaalgos/lbtt.hh: Typos.
* src/tgbatest/spotlbtt.test: Typo. * src/tgbatest/spotlbtt.test: Typo.
* wrap/python/spot.i (unblock_signal): New function. * wrap/python/spot.i (unblock_signal): New function.

8
src/tgbaalgos/lbtt.hh
View file

@ -1,4 +1,4 @@
// Copyright (C) 2003 Laboratoire d'Informatique de Paris 6 (LIP6), // Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
// département Systèmes Répartis Coopératifs (SRC), Université Pierre // département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie. // et Marie Curie.
// //
@ -33,13 +33,13 @@ namespace spot
/// labeled by propositional formulae, and generalized /// labeled by propositional formulae, and generalized
/// Büchi acceptance conditions on \b states. This /// Büchi acceptance conditions on \b states. This
/// is unlike our spot::tgba automata which put /// is unlike our spot::tgba automata which put
/// both generalized acceptance conditions and propositional /// both generalized acceptance conditions (and propositional
/// formulae) on \b transitions. /// formulae) on \b transitions.
/// ///
/// This algorithm will therefore produce an automata where /// This algorithm will therefore produce an automata where
/// acceptance conditions have been moved from each transition to /// acceptance conditions have been moved from each transition to
/// previous state. In the worst case, doing so will multiply the /// the previous state. In the worst case, doing so will multiply
/// number of states and transitions of the automata by /// the number of states and transitions of the automata by
/// <code>2^|Acc|</code>. where <code>|Acc|</code> is the number of /// <code>2^|Acc|</code>. where <code>|Acc|</code> is the number of
/// acceptance conditions used by the automata. (It can be a bit /// acceptance conditions used by the automata. (It can be a bit
/// more because LBTT allows only for one initial state: /// more because LBTT allows only for one initial state: