Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7302664> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Q7302664 subject Q7036095.
- Q7302664 abstract "Template:ForIn 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.".
- Q7302664 wikiPageExternalLink MPRI.pdf.
- Q7302664 wikiPageWikiLink Q1073063.
- Q7302664 wikiPageWikiLink Q1464168.
- Q7302664 wikiPageWikiLink Q18393572.
- Q7302664 wikiPageWikiLink Q185359.
- Q7302664 wikiPageWikiLink Q185837.
- Q7302664 wikiPageWikiLink Q192161.
- Q7302664 wikiPageWikiLink Q208237.
- Q7302664 wikiPageWikiLink Q21083858.
- Q7302664 wikiPageWikiLink Q21198.
- Q7302664 wikiPageWikiLink Q214526.
- Q7302664 wikiPageWikiLink Q242767.
- Q7302664 wikiPageWikiLink Q3321297.
- Q7302664 wikiPageWikiLink Q3968.
- Q7302664 wikiPageWikiLink Q466109.
- Q7302664 wikiPageWikiLink Q5500266.
- Q7302664 wikiPageWikiLink Q6516990.
- Q7302664 wikiPageWikiLink Q7036095.
- Q7302664 wikiPageWikiLink Q7295782.
- Q7302664 wikiPageWikiLink Q7333652.
- Q7302664 wikiPageWikiLink Q7449364.
- Q7302664 wikiPageWikiLink Q752532.
- Q7302664 wikiPageWikiLink Q818930.
- Q7302664 wikiPageWikiLink Q837518.
- Q7302664 wikiPageWikiLink Q849775.
- Q7302664 comment "Template:ForIn 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.".
- Q7302664 label "Recognizable set".