On automatic infinite permutations
From MaRDI portal
Publication:2911428
DOI10.1051/ita/2011129zbMath1247.05007arXiv1109.6131OpenAlexW2963849364MaRDI QIDQ2911428
Publication date: 31 August 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6131
orderingpermutationinfinite wordThue-Morse wordinfinite permutationautomatic permutationautomatic wordThue-Morse permutation
Related Items
Minimal complexity of equidistributed infinite permutations, On the permutation complexity of the Cantor-like sequences
Cites Work
- Unnamed Item
- Infinite permutations of lowest maximal pattern complexity
- Permutation complexity of the Thue-Morse word
- On the infinite permutation generated by the period doubling word
- On an infinite permutation similar to the Thue-Morse word
- Periodicity, repetitions, and orbits of an automatic sequence
- On permutations generated by infinite binary words
- On periodicity and low complexity of infinite permutations
- Suites algébriques, automates et substitutions
- On permutations containing no long arithmetic progressions
- Automatic Sequences
- Enumeration and Decidable Properties of Automatic Sequences
- Uniform tag sequences