Recognizable set
http://dbpedia.org/resource/Recognizable_set an entity of type: ProgrammingLanguage
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.
rdf:langString
在数学和计算机科学中，可识别语言是可被有限状态机识别的形式语言。等价的说，可识别语言是语法关系的商的家族为有限的的形式语言。
rdf:langString
rdf:langString
Recognizable set
rdf:langString
Распознаваемое подмножество моноида
rdf:langString
可识别语言
xsd:integer
37414468
xsd:integer
1103568381
rdf:langString
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.
rdf:langString
在数学和计算机科学中，可识别语言是可被有限状态机识别的形式语言。等价的说，可识别语言是语法关系的商的家族为有限的的形式语言。
xsd:nonNegativeInteger
6144