Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17019301> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q17019301 subject Q7142640.
- Q17019301 abstract "In theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable. It is named after the computer scientist Sheila Greibach, who first proved it in 1963.".
- Q17019301 wikiPageWikiLink Q11615.
- Q17019301 wikiPageWikiLink Q126002.
- Q17019301 wikiPageWikiLink Q176452.
- Q17019301 wikiPageWikiLink Q184754.
- Q17019301 wikiPageWikiLink Q1917459.
- Q17019301 wikiPageWikiLink Q192161.
- Q17019301 wikiPageWikiLink Q2878974.
- Q17019301 wikiPageWikiLink Q338047.
- Q17019301 wikiPageWikiLink Q3502995.
- Q17019301 wikiPageWikiLink Q373045.
- Q17019301 wikiPageWikiLink Q645527.
- Q17019301 wikiPageWikiLink Q7142640.
- Q17019301 wikiPageWikiLink Q729271.
- Q17019301 wikiPageWikiLink Q752532.
- Q17019301 wikiPageWikiLink Q849775.
- Q17019301 wikiPageWikiLink Q908674.
- Q17019301 comment "In theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable. It is named after the computer scientist Sheila Greibach, who first proved it in 1963.".
- Q17019301 label "Greibach's theorem".