Permutation complexity of images of Sturmian words by marked morphisms

Adam Borchert, Narad Rampersad

Source record

Source: Crossref

Published: Jun 4, 2018

DOI: 10.23638/dmtcs-20-1-20

Open original source ↗

Source abstract

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. Comment: 9 pages

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Permutation complexity of images of Sturmian words by marked morphisms — Mathematical Frontier Network