abstract:In computer science, more precisely in automata theory, a recognizable set of a monoid is a submonoid which can be mapped in a certain sense to some finite monoid through some morphism. Recognizable sets are useful in automata theory, formal languages and algebra.
President Clinton used Washington's most recognizableset, the White House, to announce that most cinema owners had agreed to require young people to show photo IDs when they ask for tickets to R-rated movies (an R rating means those under 17 must be accompanied by a parent or adult guardian).