Words with unbounded periodicity complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287276" target="_blank" >RIV/00216208:11320/14:10287276 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0218196714500362" target="_blank" >http://dx.doi.org/10.1142/S0218196714500362</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0218196714500362" target="_blank" >10.1142/S0218196714500362</a>
Alternative languages
Result language
angličtina
Original language name
Words with unbounded periodicity complexity
Original language description
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at infinitely many positions.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Algebra and Computation
ISSN
0218-1967
e-ISSN
—
Volume of the periodical
24
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
827-836
UT code for WoS article
000345242200004
EID of the result in the Scopus database
—