Matches in DBpedia 2015-10 for { ?s ?p "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."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Recognizable_set abstract "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 comment "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.".