* 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
This commit is contained in:
Maximilien Colange 2017-08-18 09:35:40 +02:00
parent f5dce597c6
commit eb91ecf66f
8 changed files with 35 additions and 35 deletions

10
NEWS
View file

@ -22,8 +22,8 @@ New in spot 2.3.5.dev (not yet released)
LTL translators).
- autfilt learned to build the union (--sum) or the intersection
(--sum-and) of two language by putting two automata side-by-side
and fiddling with the initial states. This complement the already
(--sum-and) of two languages by putting two automata side-by-side
and fiddling with the initial states. This complements the already
implemented intersection (--product) and union (--product-or),
both based on a product.
@ -57,7 +57,7 @@ New in spot 2.3.5.dev (not yet released)
- twa objects have a new property: prop_complete(). This obviously
acts as a cache for the is_complete() function.
- spot::dualize() completements any alternating automaton. Since
- spot::dualize() complements any alternating automaton. Since
the dual of a deterministic automaton is still deterministic, the
function spot::dtwa_complement() has been deprecated and simply
calls spot::dualize().
@ -198,7 +198,7 @@ New in spot 2.3.5.dev (not yet released)
been adjusted to these new semantics, see "Backward-incompatible
changes" below.
- The parser for HOA now recognize and verifies correct use of the
- The parser for HOA now recognizes and verifies correct use of the
"univ-branch" property. This is known to be a problem with option
-H1 of ltl3ba 1.1.2 and ltl3dra 0.2.4, so the environment variable
SPOT_HOA_TOLERANT can be set to disable the diagnostic.
@ -212,7 +212,7 @@ New in spot 2.3.5.dev (not yet released)
- When the remove_fin() function was called on some automaton with
Inf-less acceptance involving at least one disjunction (e.g.,
generalized co-Büchi), it would sometime output an automaton with
generalized co-Büchi), it would sometimes output an automaton with
transition-based acceptance but marked as state-based.
Backward-incompatible changes: