Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Complexity_function> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Complexity_function abstract "In computer science, the complexity function of a string, a finite or infinite sequence of letters from some alphabet, is the function that counts the number of distinct factors (substrings of consecutive symbols) from that string. More generally, the complexity function of a language, a set of finite words over an alphabet, counts the number of distinct words of given length.".
- Complexity_function wikiPageExternalLink crmm-27.
- Complexity_function wikiPageID "28928091".
- Complexity_function wikiPageLength "10172".
- Complexity_function wikiPageOutDegree "24".
- Complexity_function wikiPageRevisionID "678305640".
- Complexity_function wikiPageWikiLink American_Mathematical_Society.
- Complexity_function wikiPageWikiLink Cambridge_University_Press.
- Complexity_function wikiPageWikiLink Category:Theoretical_computer_science.
- Complexity_function wikiPageWikiLink Champernowne_constant.
- Complexity_function wikiPageWikiLink Champernowne_word.
- Complexity_function wikiPageWikiLink Computer_science.
- Complexity_function wikiPageWikiLink Disjunctive_sequence.
- Complexity_function wikiPageWikiLink Disjunctive_word.
- Complexity_function wikiPageWikiLink Fibonacci_word.
- Complexity_function wikiPageWikiLink Hamming_weight.
- Complexity_function wikiPageWikiLink Irrational_number.
- Complexity_function wikiPageWikiLink Normal_number.
- Complexity_function wikiPageWikiLink Rational_number.
- Complexity_function wikiPageWikiLink Rauzy_fractal.
- Complexity_function wikiPageWikiLink Recurrent_word.
- Complexity_function wikiPageWikiLink Regular_language.
- Complexity_function wikiPageWikiLink Sparse_language.
- Complexity_function wikiPageWikiLink Springer-Verlag.
- Complexity_function wikiPageWikiLink Springer_Science+Business_Media.
- Complexity_function wikiPageWikiLink Sturmian_word.
- Complexity_function wikiPageWikiLink Subadditivity.
- Complexity_function wikiPageWikiLink Topological_entropy.
- Complexity_function wikiPageWikiLink Tribonacci_word.
- Complexity_function wikiPageWikiLink Uniformly_recurrent_word.
- Complexity_function wikiPageWikiLinkText "Complexity function".
- Complexity_function wikiPageWikiLinkText "complexity function".
- Complexity_function hasPhotoCollection Complexity_function.
- Complexity_function wikiPageUsesTemplate Template:Cite_book.
- Complexity_function wikiPageUsesTemplate Template:Reflist.
- Complexity_function subject Category:Theoretical_computer_science.
- Complexity_function hypernym Function.
- Complexity_function type Area.
- Complexity_function type ProgrammingLanguage.
- Complexity_function type Area.
- Complexity_function comment "In computer science, the complexity function of a string, a finite or infinite sequence of letters from some alphabet, is the function that counts the number of distinct factors (substrings of consecutive symbols) from that string. More generally, the complexity function of a language, a set of finite words over an alphabet, counts the number of distinct words of given length.".
- Complexity_function label "Complexity function".
- Complexity_function sameAs Complexitxc3xa9_dun_mot.
- Complexity_function sameAs m.0dgs8cw.
- Complexity_function sameAs Q5156625.
- Complexity_function sameAs Q5156625.
- Complexity_function wasDerivedFrom Complexity_function?oldid=678305640.
- Complexity_function isPrimaryTopicOf Complexity_function.