Commit cc498e70 authored by Alexandre Duret-Lutz's avatar Alexandre Duret-Lutz
Browse files

org: run a spell checker on the documentation

* doc/org/autcross.org, doc/org/autfilt.org, doc/org/citing.org,
doc/org/compile.org, doc/org/concepts.org, doc/org/csv.org,
doc/org/dstar2tgba.org, doc/org/genaut.org, doc/org/genltl.org,
doc/org/hierarchy.org, doc/org/hoa.org, doc/org/index.org,
doc/org/install.org, doc/org/ltl2tgba.org, doc/org/ltl2tgta.org,
doc/org/ltlcross.org, doc/org/ltlfilt.org, doc/org/ltlgrind.org,
doc/org/ltlsynt.org, doc/org/oaut.org, doc/org/randaut.org,
doc/org/randltl.org, doc/org/satmin.org, doc/org/tut.org,
doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org,
doc/org/tut04.org, doc/org/tut10.org, doc/org/tut11.org,
doc/org/tut12.org, doc/org/tut20.org, doc/org/tut21.org,
doc/org/tut22.org, doc/org/tut23.org, doc/org/tut24.org,
doc/org/tut30.org, doc/org/tut31.org, doc/org/tut50.org,
doc/org/tut51.org, doc/org/tut52.org, doc/org/tut90.org,
doc/org/upgrade2.org: Run ispell-buffer on all these.
* bin/autfilt.cc, python/spot/__init__.py: Fix typos in
help texts noticed while spell-checking the org files.
parent 0342161b
Pipeline #20621 passed with stage
in 118 minutes and 53 seconds
......@@ -593,5 +593,5 @@ class, used to build on-the-fly product.
# LocalWords: nondeterministicaly kripke succ plantuml uml png iter
# LocalWords: bdd ptr const init bool dst cond acc pos ithvar ap ss
# LocalWords: xodd yodd str nullptr noweb cmdline Tpng cmd circo GF
# LocalWords: txt LTL af preallocated deallocation destructor
# LocalWords: unicity
# LocalWords: txt LTL af preallocated deallocation destructor svg
# LocalWords: unicity kA src cpp tooltip
......@@ -26,7 +26,7 @@ memory.
Our Kripke structure represent a model whose states consist of pairs
of modulo-3 integers $(x,y)$. At any state the possible actions
will be to increment any one of the two integer (nondeterministicaly).
will be to increment any one of the two integers (nondeterministically).
That increment is obviously done modulo 3. For instance state $(1,2)$
has two possible successors:
- $(2,2)$ if =x= was incremented, or
......@@ -303,3 +303,6 @@ read the C++ description for details.
#+BEGIN_SRC text :noweb yes
<<demo-2py()>>
#+END_SRC
# LocalWords: utf html kripke SRC bool bdd ithvar ap init noweb svg
# LocalWords: GraphViz's cmd circo txt GF af py bdddict ns str
......@@ -37,7 +37,7 @@ automata agree on the BDD variables used to represent $a$ and $b$.
The =spot::bdd_dict= object is in charge of allocating BDD variables,
and ensuring that multiple users reuse the same variables for similar
purpose. When a =twa_graph= automaton is constructed, it takes a
=bdd_dict= as argument. Everytime an atomic proposition is
=bdd_dict= as argument. Every time an atomic proposition is
registered through the =twa::register_ap()= method, the =bdd_dict=
is queried.
......@@ -445,3 +445,8 @@ variables *anonymous* because their meaning is unknown the the
#+RESULTS:
: [(0, 2), (0, 3), (1, 0), (1, 1), (2, 2), (2, 3), (3, 0), (3, 1)]
# LocalWords: utf bdd html args BDDs DAGs twa SRC aut ap bff src
# LocalWords: unregisters unregister dest init dst str num cond GF
# LocalWords: noweb XXa RuntimeError del v'i anonbase bddfalse isop
# LocalWords: ithvar
......@@ -79,7 +79,7 @@ experience of updating a couple of projects that are using Spot.
=tgba_explicit_string= used to encode a TGBA using a graph whose
state was named using LTL formulas, integers, or strings) are
replaced by a =twa_graph= class in which the representation is
more complact and efficient, but where states are necessarily
more compact and efficient, but where states are necessarily
numbered. Many algorithms have been rewritten on top of this
=twa_graph= class, and this simplified them a lot.
......@@ -362,7 +362,7 @@ removed, ~8200 lines added), and brings some nice benefits:
- LTL/PSL formulas are now represented by lightweight formula
objects (instead of pointers to children of an abstract
formula class) that perform reference counting automatically.
- There is no hierachy anymore: all operators are represented by
- There is no hierarchy anymore: all operators are represented by
a single type of node in the syntax tree, and an enumerator is
used to distinguish between operators.
- Visitors have been replaced by member functions such as =map()=
......@@ -667,3 +667,14 @@ for (auto i: aut->succ(s))
| ~tgba_succ_iterator::current_acceptance_conditions()~ | ~twa_succ_iterator::acc()~ | |
| ~tgba_succ_iterator::current_condition()~ | ~twa_succ_iterator::cond()~ | |
| ~tgba_succ_iterator::current_state()~ | ~twa_succ_iterator::dst()~ | |
# LocalWords: utf html cpp BuDDy ptr TGBA tgba twa tgba renamings
# LocalWords: reimplemented cpp SRC bdd bddx BuDDy bvec bvecx fdd
# LocalWords: fddx dstarparse eltlparse iface kripke adhoc ltlast
# LocalWords: kripkeparse ltlenv ltlparse ltlvisit config sabaalgos
# LocalWords: neverparse saba taalgos tgbaalgos dualize tgbaparse
# LocalWords: libbdd libbddx lspot lbddx lbdd namespace ptr xargs
# LocalWords: typedefs sed aut taa tgta acc buchi myalgorithm succ
# LocalWords: iter num dst cond BDDs arg dstar dtgba dupexp bfs dfs
# LocalWords: instantiator hoaf lbtt tl simplifier boolean psl str
# LocalWords: lbt sclatex utg utf neverclaim scc
......@@ -780,7 +780,7 @@ _add_formula('are_equivalent', 'equivalent_to')
def postprocess(automaton, *args, formula=None, xargs=None):
"""Post process an automaton.
This applies a number of simlification algorithms, depending on
This applies a number of simplification algorithms, depending on
the options supplied. Keep in mind that 'Deterministic' expresses
just a preference that may not be satisfied if the input is
not already 'Deterministic'.
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment