alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Typos

Browse source 
* 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
Download patch file Download diff file Expand all files Collapse all files

6
spot/twaalgos/ltl2tgba_fm.hh
View file

@ -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,

2
spot/twaalgos/sccinfo.hh
View file

@ -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>

2
spot/twaalgos/translate.cc
View file

@ -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.