| Autor: |
Jansirani, N., Vigneswaran, L., Dare, V. R. |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2023, Vol. 2829 Issue 1, p1-8, 8p |
| Abstrakt: |
A word w in finite sequence of elements A∗ called letters and a sub-word of w contained in an infinite Kolakoski sequence K explained. An infinite Kolakoski sequence of word in various length |w| of the binary alphabet {1, 2} is partitioned as i blocks and j positions. Then for every positive integer n, the equivalence relation kn on A∗ is analyzed. In an infinite Kolakoksi sequence every Kolakoski word generates minimum of one and maximum of two sub-words δ {i, j} for every n ≥ 1 is shown. Also for every n the minimal and maximal distance of Kolakoski sub-words are increasing and decreasing respectively is established. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
