Natural Sciences and Engineering Research Council of Canada
Indicators
1094
Views
592
Downloads
Permutation complexity of images of Sturmian words by marked morphisms
Adam Borchert, Narad Rampersad
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
Keywords
Mathematics - Combinatorics
Computer Science - Formal Languages and Automata Theory
