 Indeed, such a language is recognized by the transition monoid of any automaton that recognizes the language.The recognizable subsets of formula_20 are the ultimately periodic sets of integers.A subset of formula_1 is recognizable if and only if its syntactic monoid is finite.