Permutation complexity of the Thue-Morse word

DOI10.1016/j.aam.2010.08.002zbMath1234.05012arXiv1003.6123OpenAlexW2037993261MaRDI QIDQ550264

Steven Widmer

Publication date: 8 July 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Thue-Morse wordinfinite permutationpermutation complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

Canonical Representatives of Morphic Permutations, On automatic infinite permutations, Minimal complexity of equidistributed infinite permutations, On the permutation complexity of the Cantor-like sequences, Unnamed Item, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, Factor complexity and permutation complexity of the generalized Morse sequence, PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP

Cites Work

• Unnamed Item
• Unnamed Item
• Infinite permutations of lowest maximal pattern complexity
• 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 permutations generated by infinite binary words
• On periodicity and low complexity of infinite permutations