3.3.2.2. Searching from an automaton perspective

We have created the following list of keywords, which allow for finding all global constraints defined by a specific type of automaton that recognises its solutionsAutomata that recognise the solutions of a global constraint were introduced in the section β€œDescribing Explicitly Global Constraints”.:

  • Automaton indicates that the catalogue provides a deterministic automaton,

  • Automaton without counters indicates that the catalogue provides a deterministic automaton without counters as well as without array of counters,

  • Automaton with counters indicates that the catalogue provides a deterministic automaton with counters but without array of counters,

  • Automaton with array of counters indicates that the catalogue provides a deterministic automaton with array of counters and possibly with counters.

In addition, we also provide a list of keywords that characterise the structure of the hypergraph associated with the decomposition of the automaton of a global constraints (i.e.,Β see the meta -keyword constraint network structure). Note that, when a global constraint is defined by several graph properties it is also defined by several automata (usually one automata for each graph property). This is for instance the case of the πšŒπš‘πšŠπš—πšπšŽ_πšŒπš˜πš—πšπš’πš—πšžπš’πšπš’ constraint. Currently we have these keywords:

When a global constraint is only defined by one or several automaton its signature is set to the keyword π™°πš„πšƒπ™Ύπ™Όπ™°πšƒπ™Ύπ™½.