Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Recognizable_set> ?p ?o }
Showing triples 1 to 59 of
59
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 wikiPageExternalLink MPRI.pdf.
- Recognizable_set wikiPageID "37414468".
- Recognizable_set wikiPageLength "5071".
- Recognizable_set wikiPageOutDegree "28".
- Recognizable_set wikiPageRevisionID "682069526".
- Recognizable_set wikiPageWikiLink Algebra.
- Recognizable_set wikiPageWikiLink Alphabet_(computer_science).
- Recognizable_set wikiPageWikiLink Alphabet_(formal_languages).
- Recognizable_set wikiPageWikiLink Automata_theory.
- Recognizable_set wikiPageWikiLink Category:Automata_theory.
- Recognizable_set wikiPageWikiLink Complement_(set_theory).
- Recognizable_set wikiPageWikiLink Computability_theory.
- Recognizable_set wikiPageWikiLink Computer_science.
- Recognizable_set wikiPageWikiLink Finite_index.
- Recognizable_set wikiPageWikiLink Finitely_generated_group.
- Recognizable_set wikiPageWikiLink Formal_language.
- Recognizable_set wikiPageWikiLink Free_monoid.
- Recognizable_set wikiPageWikiLink Generating_set_of_a_group.
- Recognizable_set wikiPageWikiLink Index_of_a_subgroup.
- Recognizable_set wikiPageWikiLink Intersection_(set_theory).
- Recognizable_set wikiPageWikiLink Kleene_star.
- Recognizable_set wikiPageWikiLink Left_quotient.
- Recognizable_set wikiPageWikiLink McKnights_theorem.
- Recognizable_set wikiPageWikiLink Mezeis_theorem.
- Recognizable_set wikiPageWikiLink Monoid.
- Recognizable_set wikiPageWikiLink Rational_monoid.
- Recognizable_set wikiPageWikiLink Rational_set.
- Recognizable_set wikiPageWikiLink Recognizable_language.
- Recognizable_set wikiPageWikiLink Recursively_enumerable_language.
- Recognizable_set wikiPageWikiLink Regular_language.
- Recognizable_set wikiPageWikiLink Right_quotient.
- Recognizable_set wikiPageWikiLink Semiautomaton.
- Recognizable_set wikiPageWikiLink Set_complement.
- Recognizable_set wikiPageWikiLink Set_intersection.
- Recognizable_set wikiPageWikiLink Set_union.
- Recognizable_set wikiPageWikiLink Subgroup.
- Recognizable_set wikiPageWikiLink Syntactic_monoid.
- Recognizable_set wikiPageWikiLink Transition_monoid.
- Recognizable_set wikiPageWikiLink Union_(set_theory).
- Recognizable_set wikiPageWikiLinkText "Recognizable set".
- Recognizable_set wikiPageWikiLinkText "Recognizable".
- Recognizable_set wikiPageWikiLinkText "recognizable set".
- Recognizable_set wikiPageWikiLinkText "recognizable subset".
- Recognizable_set wikiPageWikiLinkText "recognizes".
- Recognizable_set hasPhotoCollection Recognizable_set.
- Recognizable_set wikiPageUsesTemplate Template:Cite_book.
- Recognizable_set wikiPageUsesTemplate Template:For.
- Recognizable_set wikiPageUsesTemplate Template:Reflist.
- Recognizable_set subject Category:Automata_theory.
- Recognizable_set hypernym Subset.
- Recognizable_set type Software.
- 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.".
- Recognizable_set label "Recognizable set".
- Recognizable_set sameAs m.0nb8t4h.
- Recognizable_set sameAs Q7302664.
- Recognizable_set sameAs Q7302664.
- Recognizable_set wasDerivedFrom Recognizable_set?oldid=682069526.
- Recognizable_set isPrimaryTopicOf Recognizable_set.