* src/sanity/style.test: Catch occurrences of "accepting condition".

* bench/emptchk/ltl-human.sh, bench/emptchk/ltl-random.sh,
src/sanity/style.test, src/tgba/bdddict.cc,
src/tgba/succiterconcrete.hh, src/tgba/tgbabddcoredata.hh,
src/tgba/tgbareduc.cc, src/tgba/tgbareduc.hh,
src/tgbaalgos/gv04.cc, src/tgbaalgos/gv04.hh,
src/tgbaalgos/magic.cc, src/tgbaalgos/magic.hh,
src/tgbaalgos/se05.cc, src/tgbaalgos/se05.hh,
src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03.hh,
src/tgbaalgos/tau03opt.cc, src/tgbaalgos/tau03opt.hh,
src/tgbatest/dfs.test: Replace them by "acceptance condition".

src/tgbaalgos/gv04.cc

@@ -52,7 +52,7 @@ namespace spot
 
     struct gv04: public emptiness_check, public ec_statistics
     {
-      // The unique accepting condition of the automaton \a a,
+      // The unique acceptance condition of the automaton \a a,
       // or bddfalse if there is no.
       bdd accepting;
 

src/tgbaalgos/gv04.hh

@@ -32,7 +32,7 @@ namespace spot
   /// \brief Emptiness check based on Geldenhuys and Valmari's
   /// TACAS'04 paper.
   /// \ingroup emptiness_check_algorithms
-  /// \pre The automaton \a a must have at most one accepting condition.
+  /// \pre The automaton \a a must have at most one acceptance condition.
   ///
   /// The original algorithm, coming from the following paper, has only
   /// been slightly modified to work on transition-based automata.

src/tgbaalgos/magic.cc

@@ -44,14 +44,14 @@ namespace spot
     enum color {WHITE, BLUE, RED};
 
     /// \brief Emptiness checker on spot::tgba automata having at most one
-    /// accepting condition (i.e. a TBA).
+    /// acceptance condition (i.e. a TBA).
     template <typename heap>
     class magic_search_ : public emptiness_check, public ec_statistics
     {
     public:
       /// \brief Initialize the Magic Search algorithm on the automaton \a a
       ///
-      /// \pre The automaton \a a must have at most one accepting
+      /// \pre The automaton \a a must have at most one acceptance
       /// condition (i.e. it is a TBA).
       magic_search_(const tgba *a, size_t size, option_map o = option_map())
         : emptiness_check(a, o),
@@ -175,7 +175,7 @@ namespace spot
       /// State targeted by the red dfs.
       const state* target;
 
-      /// The unique accepting condition of the automaton \a a.
+      /// The unique acceptance condition of the automaton \a a.
       bdd all_cond;
 
       bool dfs_blue()

src/tgbaalgos/magic.hh

@@ -35,13 +35,13 @@ namespace spot
 
   /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at most one accepting condition (i.e.
+  /// \pre The automaton \a a must have at most one acceptance condition (i.e.
   /// it is a TBA).
   ///
   /// During the visit of \a a, the returned checker stores explicitely all
   /// the traversed states.
   /// The method \a check() of the checker can be called several times
-  /// (until it returns a null pointer) to enumerate all the visited accepting
+  /// (until it returns a null pointer) to enumerate all the visited acceptance
   /// paths. The implemented algorithm is the following:
   ///
   /// \verbatim
@@ -101,7 +101,7 @@ namespace spot
 
   /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at most one accepting condition (i.e.
+  /// \pre The automaton \a a must have at most one acceptance condition (i.e.
   /// it is a TBA).
   ///
   /// During the visit of \a a, the returned checker does not store explicitely

src/tgbaalgos/se05.cc

@@ -44,14 +44,14 @@ namespace spot
     enum color {WHITE, CYAN, BLUE, RED};
 
     /// \brief Emptiness checker on spot::tgba automata having at most one
-    /// accepting condition (i.e. a TBA).
+    /// acceptance condition (i.e. a TBA).
     template <typename heap>
     class se05_search : public emptiness_check, public ec_statistics
     {
     public:
       /// \brief Initialize the Magic Search algorithm on the automaton \a a
       ///
-      /// \pre The automaton \a a must have at most one accepting
+      /// \pre The automaton \a a must have at most one acceptance
       /// condition (i.e. it is a TBA).
       se05_search(const tgba *a, size_t size, option_map o = option_map())
         : emptiness_check(a, o),
@@ -172,7 +172,7 @@ namespace spot
       /// by the last dfs visiting it.
       heap h;
 
-      /// The unique accepting condition of the automaton \a a.
+      /// The unique acceptance condition of the automaton \a a.
       bdd all_cond;
 
       bool dfs_blue()

src/tgbaalgos/se05.hh

@@ -35,7 +35,7 @@ namespace spot
 
   /// \brief Returns an emptiness check on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at most one accepting condition (i.e.
+  /// \pre The automaton \a a must have at most one acceptance condition (i.e.
   /// it is a TBA).
   ///
   /// During the visit of \a a, the returned checker stores explicitely all
@@ -105,7 +105,7 @@ namespace spot
                                         option_map o = option_map());
   /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at most one accepting condition (i.e.
+  /// \pre The automaton \a a must have at most one acceptance condition (i.e.
   /// it is a TBA).
   ///
   /// During the visit of \a a, the returned checker does not store explicitely

src/tgbaalgos/tau03.cc

@@ -47,7 +47,7 @@ namespace spot
     enum color {WHITE, BLUE};
 
     /// \brief Emptiness checker on spot::tgba automata having at most one
-    /// accepting condition (i.e. a TBA).
+    /// acceptance condition (i.e. a TBA).
     template <typename heap>
     class tau03_search : public emptiness_check, public ec_statistics
     {
@@ -146,7 +146,7 @@ namespace spot
       /// by the last dfs visiting it.
       heap h;
 
-      /// The unique accepting condition of the automaton \a a.
+      /// The unique acceptance condition of the automaton \a a.
       bdd all_cond;
 
       bool dfs_blue()

src/tgbaalgos/tau03.hh

@@ -34,7 +34,7 @@ namespace spot
 
   /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at least one accepting condition.
+  /// \pre The automaton \a a must have at least one acceptance condition.
   ///
   /// During the visit of \a a, the returned checker stores explicitely all
   /// the traversed states. The implemented algorithm is the following:

src/tgbaalgos/tau03opt.cc

@@ -57,7 +57,7 @@ namespace spot
     enum color {WHITE, CYAN, BLUE};
 
     /// \brief Emptiness checker on spot::tgba automata having at most one
-    /// accepting condition (i.e. a TBA).
+    /// acceptance condition (i.e. a TBA).
     template <typename heap>
     class tau03_opt_search : public emptiness_check, public ec_statistics
     {
@@ -160,7 +160,7 @@ namespace spot
       /// by the last dfs visiting it.
       heap h;
 
-      /// The unique accepting condition of the automaton \a a.
+      /// The unique acceptance condition of the automaton \a a.
       bdd all_acc;
 
       /// Whether to use the "condition stack".

src/tgbaalgos/tau03opt.hh

@@ -34,7 +34,7 @@ namespace spot
 
   /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
   ///
-  /// \pre The automaton \a a must have at least one accepting condition.
+  /// \pre The automaton \a a must have at least one acceptance condition.
   ///
   /// During the visit of \a a, the returned checker stores explicitely all
   /// the traversed states. The implemented algorithm is the following: