Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Smallest_grammar_problem> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Smallest_grammar_problem abstract "In data compression and the theory of formal languages, the smallest grammar problem is the problem of finding the smallest context-free grammar that generates a given string of characters. The size of a grammar is defined by some authors as the number of symbols on the right side of the production rules.Others also add the number of rules to that. The (decision version of the) problem is NP-complete.".
- Smallest_grammar_problem wikiPageExternalLink grammar.pdf.
- Smallest_grammar_problem wikiPageID "4929352".
- Smallest_grammar_problem wikiPageLength "2227".
- Smallest_grammar_problem wikiPageOutDegree "10".
- Smallest_grammar_problem wikiPageRevisionID "678387588".
- Smallest_grammar_problem wikiPageWikiLink Category:Formal_languages.
- Smallest_grammar_problem wikiPageWikiLink Context-free_grammar.
- Smallest_grammar_problem wikiPageWikiLink Data_compression.
- Smallest_grammar_problem wikiPageWikiLink Formal_language.
- Smallest_grammar_problem wikiPageWikiLink Grammar-based_code.
- Smallest_grammar_problem wikiPageWikiLink Kolmogorov_Complexity.
- Smallest_grammar_problem wikiPageWikiLink Kolmogorov_complexity.
- Smallest_grammar_problem wikiPageWikiLink Lossless_compression.
- Smallest_grammar_problem wikiPageWikiLink Lossless_data_compression.
- Smallest_grammar_problem wikiPageWikiLink NP-complete.
- Smallest_grammar_problem wikiPageWikiLink NP-completeness.
- Smallest_grammar_problem wikiPageWikiLink Straight-line_grammar.
- Smallest_grammar_problem wikiPageWikiLink String_(computer_science).
- Smallest_grammar_problem wikiPageWikiLinkText "Smallest grammar problem".
- Smallest_grammar_problem hasPhotoCollection Smallest_grammar_problem.
- Smallest_grammar_problem wikiPageUsesTemplate Template:Algorithm-stub.
- Smallest_grammar_problem wikiPageUsesTemplate Template:Cite_book.
- Smallest_grammar_problem wikiPageUsesTemplate Template:Reflist.
- Smallest_grammar_problem subject Category:Formal_languages.
- Smallest_grammar_problem hypernym Problem.
- Smallest_grammar_problem type Disease.
- Smallest_grammar_problem type Language.
- Smallest_grammar_problem type Combinatoric.
- Smallest_grammar_problem type Language.
- Smallest_grammar_problem comment "In data compression and the theory of formal languages, the smallest grammar problem is the problem of finding the smallest context-free grammar that generates a given string of characters. The size of a grammar is defined by some authors as the number of symbols on the right side of the production rules.Others also add the number of rules to that. The (decision version of the) problem is NP-complete.".
- Smallest_grammar_problem label "Smallest grammar problem".
- Smallest_grammar_problem sameAs m.0cvng4.
- Smallest_grammar_problem sameAs Задача_о_наименьшей_грамматике.
- Smallest_grammar_problem sameAs Q4183842.
- Smallest_grammar_problem sameAs Q4183842.
- Smallest_grammar_problem wasDerivedFrom Smallest_grammar_problem?oldid=678387588.
- Smallest_grammar_problem isPrimaryTopicOf Smallest_grammar_problem.