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.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
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.
has abstract
In computer science, more prec ...... aning in computability theory.
@en
在数学和计算机科学中，可识别语言是可被有限状态机识别的形式语言。等价的说，可识别语言是语法关系的商的家族为有限的的形式语言。
@zh
Link from a Wikipage to an external page
Wikipage page ID
37,414,468
page length (characters) of wiki page
Wikipage revision ID
966,181,509
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
In computer science, more prec ...... aning in computability theory.
@en
在数学和计算机科学中，可识别语言是可被有限状态机识别的形式语言。等价的说，可识别语言是语法关系的商的家族为有限的的形式语言。
@zh
label
Recognizable set
@en
Распознаваемое подмножество моноида
@ru
可识别语言
@zh