arXiv
Open Access
2013
Words with unbounded periodicity complexity
Štěpán Holub
Abstrak
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.
Penulis (1)
Š
Štěpán Holub
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2013
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓