In computer science, more precisely in automata theory, a recognizable set is a class of subsets of monoids that are useful in automata theory, formal languages and algebra.
In computer science, more precisely in automata theory, a recognizable set of a monoid is a submonoid which can be mapped to a finite monoid through a morphism in a certain sense. Recognizable sets are useful in automata theory, formal languages and algebra.