DOAJ Open Access 2018

Permutation complexity of images of Sturmian words by marked morphisms

Adam Borchert Narad Rampersad

Lihat Sumber DOI

Abstrak

We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.

Topik & Kata Kunci

Mathematics

Penulis (2)

Adam Borchert

Narad Rampersad

Format Sitasi

APA MLA BibTeX

Borchert, A., Rampersad, N. (2018). Permutation complexity of images of Sturmian words by marked morphisms. https://doi.org/10.23638/DMTCS-20-1-20

Akses Cepat

Lihat di Sumber doi.org/10.23638/DMTCS-20-1-20

Informasi Jurnal

Tahun Terbit: 2018
Sumber Database: DOAJ
DOI: 10.23638/DMTCS-20-1-20
Akses: Open Access ✓