3.7.25. Automaton without counters

A constraint for which the catalogue provides a deterministic automaton without counters and without array of counters. Note that the filtering algorithm [Pesant04] and the reformulation [BeldiceanuCarlssonPetit04] that were initially done in the context of deterministic automata can also be used for non-deterministic automata. All these constraints are also annotated with the keyword reified automaton constraint.