PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP

DOI10.1142/S0129054112400680zbMath1285.68140arXiv1102.5527MaRDI QIDQ2841975

Steven Widmer

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5527

zbMATH Keywords

Sturmian wordsThue-Morse wordinfinite permutationpermutation complexityuniformly recurrent

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Minimal complexity of equidistributed infinite permutations

Cites Work

• Permutation complexity of the Thue-Morse word
• On the infinite permutation generated by the period doubling word
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Enumeration of factors in the Thue-Morse word
• On periodicity and low complexity of infinite permutations
• Sequences with minimal block growth

This page was built for publication: PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP