 This notion is different from the notion of recognizable language.Indeed, the term "recognizable" has a different meaning in computability theory.Let formula_1 be a monoid, a subset formula_2 is recognized by a monoid formula_3 if there exists a morphism formula_4 from formula_1 to formula_3 such that formula_7, and recognizable if it is recognized by some finite monoid.