| http://dbpedia.org/ontology/abstract
|
In mathematics, a recurrent word or sequen … In mathematics, a recurrent word or sequence is an infinite word over a finite alphabet in which every factor occurs infinitely many times. An infinite word is recurrent if and only if it is a sesquipower. A uniformly recurrent word is a recurrent word in which for any given factor X in the sequence, there is some length nX (often much longer than the length of X) such that X appears in every block of length nX. The terms minimal sequence and almost periodic sequence (Muchnik, Semenov, Ushakov 2003) are also used.nik, Semenov, Ushakov 2003) are also used.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://www.ams.org/bookpages/crmm-27 +
|
| http://dbpedia.org/ontology/wikiPageID
|
37478359
|
| http://dbpedia.org/ontology/wikiPageLength
|
3909
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1020415119
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/American_Mathematical_Society +
, http://dbpedia.org/resource/Category:Combinatorics_on_words +
, http://dbpedia.org/resource/Sturmian_word +
, http://dbpedia.org/resource/Cambridge_University_Press +
, http://dbpedia.org/resource/Periodic_sequence +
, http://dbpedia.org/resource/Category:Formal_languages +
, http://dbpedia.org/resource/Thue%E2%80%93Morse_sequence +
, http://dbpedia.org/resource/Springer-Verlag +
, http://dbpedia.org/resource/Category:Semigroup_theory +
, http://dbpedia.org/resource/Sesquipower +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Algebra-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Formal_languages +
, http://dbpedia.org/resource/Category:Combinatorics_on_words +
, http://dbpedia.org/resource/Category:Semigroup_theory +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Word +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Recurrent_word?oldid=1020415119&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Recurrent_word +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q7303270 +
, http://rdf.freebase.com/ns/m.0p8swym +
, https://global.dbpedia.org/id/4tzao +
, http://dbpedia.org/resource/Recurrent_word +
, http://yago-knowledge.org/resource/Recurrent_word +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatFormalLanguages +
, http://dbpedia.org/class/yago/Language106282651 +
, http://dbpedia.org/class/yago/Communication100033020 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/Food +
|
| rdfs:comment |
In mathematics, a recurrent word or sequen … In mathematics, a recurrent word or sequence is an infinite word over a finite alphabet in which every factor occurs infinitely many times. An infinite word is recurrent if and only if it is a sesquipower. A uniformly recurrent word is a recurrent word in which for any given factor X in the sequence, there is some length nX (often much longer than the length of X) such that X appears in every block of length nX. The terms minimal sequence and almost periodic sequence (Muchnik, Semenov, Ushakov 2003) are also used.nik, Semenov, Ushakov 2003) are also used.
|
| rdfs:label |
Recurrent word
|
