3.7.21. Automaton

A constraint for which the catalogue provides a deterministic automaton for the ground case. This automaton can usually be used for deriving mechanically a filtering algorithm for the general case. We have the following three types of deterministic automata:

  • Deterministic automata without counters and without array of counters,

  • Deterministic automata with counters but without array of counters,

  • Deterministic automata with array of counters and possibly with counters.

Figure 3.7.5. Examples of automata

FigureΒ 3.7.5 shows three automata respectively associated with the πšπš•πš˜πš‹πšŠπš•_πšŒπš˜πš—πšπš’πšπšžπš’πšπš’, the πšŽπš‘πšŠπšŒπšπš•πš’ and the πšŠπš•πš•πšπš’πšπšπšŽπš›πšŽπš—πš constraints. These automata correspond to the three types we described above.