From 2dc115fe2cdf41c0898053c47a6f0ecf93c7f586 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Wed, 26 Apr 2017 09:04:27 +0200 Subject: [PATCH] * doc/org/concepts.org: Typos in property flag names. --- doc/org/concepts.org | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/org/concepts.org b/doc/org/concepts.org index ffe8e6a48..7b62e1d74 100644 --- a/doc/org/concepts.org +++ b/doc/org/concepts.org @@ -1065,11 +1065,11 @@ automaton, and that can be queried or set by algorithms: | =state_acc= | automaton should be considered as having state-based acceptance | | =inherently_weak= | accepting and rejecting cycles cannot be mixed in the same SCC | | =weak= | transitions of an SCC all belong to the same acceptance sets | -| =very-weak= | weak automaton where all SCCs have size 1 | +| =very_weak= | weak automaton where all SCCs have size 1 | | =terminal= | automaton is weak, accepting SCCs are complete, accepting edges may not go to rejecting SCCs | | =complete= | it is always possible to move the automaton forward, using any letter | | =universal= | there is no non-determinism branching in the automaton (hence each word is *recognized* by at most one run, but not necessarily accepted) | -| =semi-deterministic= | any nondeterminism occurs before entering an accepting SCC | +| =semi_deterministic= | any nondeterminism occurs before entering an accepting SCC | | =unambiguous= | there is at most one run *accepting* a word (but it might be recognized several time) | | =stutter_invariant= | the property recognized by the automaton is [[https://www.lrde.epita.fr/~adl/dl/adl/michaud.15.spin.pdf][stutter-invariant]] |