Typos

* NEWS, doc/org/concepts.org, doc/org/hierarchy.org,
  spot/misc/optionmap.hh, spot/twa/acc.hh, spot/twaalgos/ltl2tgba_fm.hh,
  spot/twaalgos/sccinfo.hh, spot/twaalgos/translate.cc: fix typos

spot/misc/optionmap.hh

@@ -1,5 +1,5 @@
 // -*- coding: utf-8 -*-
-// Copyright (C) 2013, 2015, 2016 Laboratoire de Recherche et
+// Copyright (C) 2013, 2015, 2016-2017 Laboratoire de Recherche et
 // Developpement de l'Epita (LRDE)
 // Copyright (C) 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
 // département Systèmes Répartis Coopératifs (SRC), Université Pierre
@@ -40,7 +40,7 @@ namespace spot
     /// \brief Add the parsed options to the map.
     ///
     /// \a options are separated by a space, comma, semicolon or tabulation and
-    /// can be optionnaly followed by an integer value (preceded by an equal
+    /// can be optionally followed by an integer value (preceded by an equal
     /// sign). If not specified, the default value is 1.
     ///
     /// The following three lines are equivalent.
@@ -87,7 +87,7 @@ namespace spot
     std::string set_str(const char* option,
                         std::string val, std::string def = {});
 
-    /// \brief Raise a runtime_error if some option haven't been used.
+    /// \brief Raise a runtime_error if some options have not been used.
     void report_unused_options() const;
 
     /// Acquire all the settings of \a o.

spot/twa/acc.hh

@@ -1081,7 +1081,7 @@ namespace spot
     ///
     /// An acceptance condition is Streett-like if it can be transformed into
     /// a Streett acceptance with little modification to its automaton.
-    /// A Streett-like acceptance condition follow one of those rules:
+    /// A Streett-like acceptance condition follows one of those rules:
     /// -It is a conjunction of disjunctive clauses containing at most one
     ///  Inf and at most one Fin.
     /// -It is true (with 0 pair)
@@ -1093,7 +1093,7 @@ namespace spot
     ///
     /// An acceptance condition is Rabin-like if it can be transformed into
     /// a Rabin acceptance with little modification to its automaton.
-    /// A Rabin-like acceptance condition follow one of those rules:
+    /// A Rabin-like acceptance condition follows one of those rules:
     /// -It is a disjunction of conjunctive clauses containing at most one
     ///  Inf and at most one Fin.
     /// -It is true (1 pair [0U, 0U])
@@ -1112,8 +1112,8 @@ namespace spot
     bool is_parity() const
     {
       bool max;
-      bool min;
-      return is_parity(max, min);
+      bool odd;
+      return is_parity(max, odd);
     }
 
     // Return (true, m) if there exist some acceptance mark m that

spot/twaalgos/ltl2tgba_fm.hh

@@ -1,5 +1,5 @@
 // -*- coding: utf-8 -*-
-// Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015 Laboratoire de
+// Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015, 2017 Laboratoire de
 // Recherche et Développement de l'Epita (LRDE).
 // Copyright (C) 2003, 2004, 2005, 2006 Laboratoire d'Informatique de
 // Paris 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
@@ -58,7 +58,7 @@ namespace spot
   /// \param exprop When set, the algorithm will consider all properties
   /// combinations possible on each state, in an attempt to reduce
   /// the non-determinism.  The automaton will have the same size as
-  /// without this option, but because the transition will be more
+  /// without this option, but because the transitions will be more
   /// deterministic, the product automaton will be smaller (or, at worse,
   /// equal).
   ///
@@ -68,7 +68,7 @@ namespace spot
   ///
   /// \param branching_postponement When set, several transitions leaving
   /// from the same state with the same label (i.e., condition + acceptance
-  /// conditions) will be merged.  This correspond to an optimization
+  /// conditions) will be merged.  This corresponds to an optimization
   /// described in the following paper.
   /** \verbatim
       @InProceedings{          sebastiani.03.charme,

spot/twaalgos/sccinfo.hh

@@ -441,7 +441,7 @@ namespace spot
     /// states of an SCC.
     ///
     /// The difference with edges_of() is that inner_edges_of()
-    /// ignores edges leaving the SCC are ignored.  In the case of
+    /// ignores edges leaving the SCC.  In the case of an
     /// alternating automaton, an edge is considered to be part of the
     /// SCC of one of its destination is in the SCC.
     internal::scc_edges<const twa_graph::graph_t, internal::keep_inner_scc>

spot/twaalgos/translate.cc

@@ -85,7 +85,7 @@ namespace spot
     //
     // This rewriting is enabled only if the formula
     //  1) has some Boolean subformula
-    //  2) has more than relabel_bool_ atomic propisition (the default
+    //  2) has more than relabel_bool_ atomic propositions (the default
     //     is 4, but this can be changed)
     //  3) relabel_bse() actually reduces the number of atomic
     //     propositions.