Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recognizable_set> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Recognizable_set abstract "In computer science, more precisely in automata theory, a recognizable set of a monoid is a submonoid that can be mapped in a certain sense to some finite monoid through some morphism. 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 wikiPageExternalLink MPRI.pdf.
- Recognizable_set wikiPageID "37414468".
- Recognizable_set wikiPageRevisionID "601242413".
- Recognizable_set hasPhotoCollection Recognizable_set.
- Recognizable_set subject Category:Automata_theory.
- Recognizable_set comment "In computer science, more precisely in automata theory, a recognizable set of a monoid is a submonoid that can be mapped in a certain sense to some finite monoid through some morphism. 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 label "Recognizable set".
- Recognizable_set sameAs m.0nb8t4h.
- Recognizable_set sameAs Q7302664.
- Recognizable_set sameAs Q7302664.
- Recognizable_set wasDerivedFrom Recognizable_set?oldid=601242413.
- Recognizable_set isPrimaryTopicOf Recognizable_set.