Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Greibachs_theorem> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Greibachs_theorem 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.".
- Greibachs_theorem wikiPageID "42138836".
- Greibachs_theorem wikiPageLength "7738".
- Greibachs_theorem wikiPageOutDegree "22".
- Greibachs_theorem wikiPageRevisionID "643833699".
- Greibachs_theorem wikiPageWikiLink Ambiguous_grammar.
- Greibachs_theorem wikiPageWikiLink Category:Formal_languages.
- Greibachs_theorem wikiPageWikiLink Concatenation.
- Greibachs_theorem wikiPageWikiLink Context-free_grammar.
- Greibachs_theorem wikiPageWikiLink Context-free_language.
- Greibachs_theorem wikiPageWikiLink Context-sensitive_grammar.
- Greibachs_theorem wikiPageWikiLink Finite-state_machine.
- Greibachs_theorem wikiPageWikiLink Formal_grammar.
- Greibachs_theorem wikiPageWikiLink Formal_language.
- Greibachs_theorem wikiPageWikiLink Formal_language_theory.
- Greibachs_theorem wikiPageWikiLink Kleene_star.
- Greibachs_theorem wikiPageWikiLink Regular_grammar.
- Greibachs_theorem wikiPageWikiLink Regular_language.
- Greibachs_theorem wikiPageWikiLink Sheila_Greibach.
- Greibachs_theorem wikiPageWikiLink String_(computer_science).
- Greibachs_theorem wikiPageWikiLink String_(formal_languages).
- Greibachs_theorem wikiPageWikiLink String_concatenation.
- Greibachs_theorem wikiPageWikiLink Theoretical_computer_science.
- Greibachs_theorem wikiPageWikiLink Undecidable_problem.
- Greibachs_theorem wikiPageWikiLinkText "Greibach's theorem".
- Greibachs_theorem hasPhotoCollection Greibachs_theorem.
- Greibachs_theorem wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- Greibachs_theorem wikiPageUsesTemplate Template:Reflist.
- Greibachs_theorem subject Category:Formal_languages.
- Greibachs_theorem 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.".
- Greibachs_theorem label "Greibach's theorem".
- Greibachs_theorem sameAs نظریه_گریباخ.
- Greibachs_theorem sameAs m.0_xbrv6.
- Greibachs_theorem sameAs Q17019301.
- Greibachs_theorem sameAs Q17019301.
- Greibachs_theorem wasDerivedFrom Greibachs_theoremoldid=643833699.
- Greibachs_theorem isPrimaryTopicOf Greibachs_theorem.