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

Fix typo automatons -> automata

Browse source 
* NEWS, spot/twaalgos/dualize.cc, spot/twaalgos/dualize.hh,
  spot/twaalgos/langmap.cc, spot/twaalgos/sum.hh,
  tests/python/streett_totgba.py: Fixes typo.
This commit is contained in:
Thomas Medioni 2017-08-09 15:51:23 +02:00
parent f0161618ca
commit 30a68d288b
6 changed files with 10 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

2
spot/twaalgos/dualize.cc
View file

@ -343,7 +343,7 @@ namespace spot
true_state_ = res->new_state();
}
// This case does not cover cmpl && !um.first
// Due to previous test shortcutting automatons that accept all words.
// Due to previous test shortcutting automata that accept all words.
else
{
assert(um.first);

2
spot/twaalgos/dualize.hh
View file

@ -35,7 +35,7 @@ namespace spot
/// be output as generalized co-Büchi.
///
/// Functions like to_generalized_buchi() or remove_fin() are frequently
/// called on existential automatons after dualize() to obtain an easier
/// called on existential automata after dualize() to obtain an easier
/// acceptance condition, but maybe at the cost of losing determinism.
///
/// If the input automaton is deterministic, the output will be deterministic.

2
spot/twaalgos/langmap.cc
View file

@ -40,7 +40,7 @@ namespace spot
std::vector<twa_graph_ptr> alt_init_st_auts(n_states);
std::vector<twa_graph_ptr> compl_alt_init_st_auts(n_states);
// Prepare all automatons needed.
// Prepare all automata needed.
for (unsigned i = 0; i < n_states; ++i)
{
twa_graph_ptr c = make_twa_graph(aut, twa::prop_set::all());

8
spot/twaalgos/sum.hh
View file

@ -25,7 +25,7 @@
namespace spot
{
/// \brief Sum two twa into a new twa, performing the union of the two input
/// automatons.
/// automata.
///
/// \param left Left term of the sum.
/// \param right Right term of the sum.
@ -35,7 +35,7 @@ namespace spot
const const_twa_graph_ptr& right);
/// \brief Sum two twa into a new twa, performing the union of the two input
/// automatons.
/// automata.
///
/// \param left Left term of the sum.
/// \param right Right term of the sum.
@ -49,7 +49,7 @@ namespace spot
unsigned right_state);
/// \brief Sum two twa into a new twa, using a universal initial transition,
/// performing the intersection of the two languages of the input automatons.
/// performing the intersection of the two languages of the input automata.
///
/// \param left Left term of the sum.
/// \param right Right term of the sum.
@ -59,7 +59,7 @@ namespace spot
const const_twa_graph_ptr& right);
/// \brief Sum two twa into a new twa, using a universal initial transition,
/// performing the intersection of the two languages of the input automatons.
/// performing the intersection of the two languages of the input automata.
///
/// \param left Left term of the sum.
/// \param right Right term of the sum.