* doc/org/concepts.org: Typos in property flag names.

doc/org/concepts.org

@@ -1059,10 +1059,10 @@ automaton, and that can be queried or set by algorithms:
 | =state_acc=          | automaton should be considered has 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 |
 | =deterministic=      | there is at most one run *recognizing* a word, but not necessarily accepting it              |
-| =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]]                                |