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.

For other uses of the word "recognizable", see Recognizable (disambiguation).

This notion is different from the notion of recognizable language. Indeed, the term "recognizable" has a different meaning in computability theory.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.