3.7.157. Non-deterministic automaton

A constraint for which the catalogue provides a non -deterministic automaton without counters and without array of counters. For the mentioned constraints it turn out that non -determinism is due to the fact that we introduce transitions labelled by the potential values of a counting variable to a single final state (i.e., see Figures 5.16.4, 5.49.4, and 5.298.4).