From 0816a4505f678da85b06bf3afa9557f2a30d8036 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Thu, 5 Feb 2004 18:44:09 +0000 Subject: [PATCH] * src/tgbaalgos/lbtt.hh: Typos. --- ChangeLog | 2 ++ src/tgbaalgos/lbtt.hh | 8 ++++---- 2 files changed, 6 insertions(+), 4 deletions(-) diff --git a/ChangeLog b/ChangeLog index 3fde27af8..b5771072d 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,5 +1,7 @@ 2004-02-05 Alexandre Duret-Lutz + * src/tgbaalgos/lbtt.hh: Typos. + * src/tgbatest/spotlbtt.test: Typo. * wrap/python/spot.i (unblock_signal): New function. diff --git a/src/tgbaalgos/lbtt.hh b/src/tgbaalgos/lbtt.hh index 4f8bcbcf2..ab80394f7 100644 --- a/src/tgbaalgos/lbtt.hh +++ b/src/tgbaalgos/lbtt.hh @@ -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 // et Marie Curie. // @@ -33,13 +33,13 @@ namespace spot /// labeled by propositional formulae, and generalized /// Büchi acceptance conditions on \b states. This /// is unlike our spot::tgba automata which put - /// both generalized acceptance conditions and propositional + /// both generalized acceptance conditions (and propositional /// formulae) on \b transitions. /// /// This algorithm will therefore produce an automata where /// acceptance conditions have been moved from each transition to - /// previous state. In the worst case, doing so will multiply the - /// number of states and transitions of the automata by + /// the previous state. In the worst case, doing so will multiply + /// the number of states and transitions of the automata by /// 2^|Acc|. where |Acc| is the number of /// acceptance conditions used by the automata. (It can be a bit /// more because LBTT allows only for one initial state: