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.

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

单词	Recognizable set
释义	Recognizable set 英语百科 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. This notion is different from the notion of recognizable language. Indeed, the term "recognizable" has a different meaning in computability theory.
随便看	retaining contact的意思 retaining crib wall的意思 retaining cup的意思 retaining current的意思 retaining cylinder的意思 retaining dam的意思 retaining devic的意思 retaining device的意思 retaining device, locking device的意思 retaining differential mechanism的意思 retaining dike的意思 retaining ditch and embankment的意思 retaining element的意思 retaining fee的意思 retaining frontwall for cable penetration的意思 retaining fruiting的意思 retaining grid的意思 Retaining harness的意思 retaining in registered position的意思 retaining ion technique的意思 retaining ledge的意思 retaining lever catch的意思 retaining log的意思 retaining lubricant的意思 retaining mechanism的意思