fix typos and indentation

* bin/autfilt.cc, python/spot/__init__.py, spot/twa/twa.hh,
spot/twa/twaproduct.cc, spot/twaalgos/couvreurnew.cc,
tests/python/bugdet.py: Here.

bin/autfilt.cc

@@ -302,7 +302,7 @@ static const argp_option options[] =
     { "decompose-scc", OPT_DECOMPOSE_SCC, "t|w|s|N|aN", 0,
       "extract the (t) terminal, (w) weak, or (s) strong part of an automaton"
       " or (N) the subautomaton leading to the Nth SCC, or (aN) to the Nth "
-      "accepting SCC (option can be combined with ccomas to extract multiple "
+      "accepting SCC (option can be combined with commas to extract multiple "
       "parts)", 0 },
     { "decompose-strength", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
     { "dualize", OPT_DUALIZE, nullptr, 0,

python/spot/__init__.py

@@ -314,7 +314,7 @@ def automata(*sources, timeout=None, ignore_abort=True,
     ----------
     *sources : list of str
         These sources can be either commands (end with `|`),
-        textual represantations of automata (contain `\n`),
+        textual representations of automata (contain `\n`),
         or filenames (else).
     timeout : int, optional
         Number of seconds to wait for the result of a command.

spot/twa/twa.hh

@@ -68,7 +68,7 @@ namespace spot
     /// hash value for this state.
     ///
     /// Note that the hash value is guaranteed to be unique for all
-    /// equal states (in compare()'s sense) for only has long has one
+    /// equal states (in compare()'s sense) for only as long as one
     /// of these states exists.  So it's OK to use a spot::state as a
     /// key in a \c hash_map because the mere use of the state as a
     /// key in the hash will ensure the state continues to exist.
@@ -1192,8 +1192,8 @@ namespace spot
     /// \brief Whether the automaton is terminal.
     ///
     /// An automaton is terminal if it is weak, its accepting strongly
-    /// components are complete, and no accepting edge lead to a
+    /// connected components are complete, and no accepting edge leads
-    /// non-accepting SCC.
+    /// to a non-accepting SCC.
     ///
     /// This property ensures that a word can be accepted as soon as
     /// on of its prefixes move through an accepting edge.

spot/twaalgos/couvreurnew.cc

@@ -475,7 +475,7 @@ namespace spot
       // Compute an accepting cycle.
       accepting_cycle();
 
-      // Compute the prefix: it is the shorted path from the initial
+      // Compute the prefix: it is the shortest path from the initial
       // state of the automaton to any state of the cycle.
 
       // Register all states from the cycle as targets of the BFS.
@@ -569,7 +569,7 @@ namespace spot
         return check_impl<true>()->accepting_run();
       }
 
-private:
+    private:
       // A union-like struct to store the result of an emptiness.
       // If the caller only wants to test emptiness, it is sufficient to
       // store the Boolean result.
@@ -684,7 +684,7 @@ private:
             // We are looking at the next successor in SUCC.
             auto succ = todo.top().second;
 
-            // If there is no more successors, backtrack.
+            // If there are no more successors, backtrack.
             if (succ->done())
               {
                 // We have explored all successors of state CURR.
@@ -766,7 +766,7 @@ private:
             if (p.first.second == -1)
               continue;
 
-            // Now this is the most interesting case.  We have reach a
+            // Now this is the most interesting case.  We have reached a
             // state S1 which is already part of a non-dead SCC.  Any such
             // non-dead SCC has necessarily been crossed by our path to
             // this state: there is a state S2 in our path which belongs

tests/python/bugdet.py

@@ -88,4 +88,4 @@ print("\nuse_simulation=False")
 b2 = spot.tgba_determinize(b, False, True, False, True)
 assert b2.num_states() == 5
 b2 = spot.remove_fin(spot.dualize(b2))
-assert not a.intersects(b1);
+assert not a.intersects(b2);