 Recognizable set

In computer science, more precisely in automata theory, a recognizable set of a monoid is a subset that can be distinguished by some morphism to a finite monoid.Recognizable sets are useful in automata theory, formal languages and algebra.