Minimal complexity of equidistributed infinite permutations
From MaRDI portal
Publication:2400969
DOI10.1016/j.ejc.2017.05.003zbMath1369.05002arXiv1503.06188OpenAlexW2962952252MaRDI QIDQ2400969
Svetlana Puzynina, Sergei V. Avgustinovich, Anna E. Frid
Publication date: 31 August 2017
Published in: European Journal of Combinatorics, Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.06188
Related Items (3)
Canonical Representatives of Morphic Permutations ⋮ Minimal complexity of equidistributed infinite permutations ⋮ Morphic words and equidistributed sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite permutations of lowest maximal pattern complexity
- Permutation complexity of the Thue-Morse word
- On the number of factors of Sturmian words
- Fine and Wilf's theorem for permutations
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- On an infinite permutation similar to the Thue-Morse word
- Some combinatorial properties of Sturmian words
- On permutations generated by infinite binary words
- Minimal complexity of equidistributed infinite permutations
- On periodicity and low complexity of infinite permutations
- On the structure of bispecial Sturmian words
- Permutation Complexity Related to the Letter Doubling Map
- PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP
- On automatic infinite permutations
- Canonical Representatives of Morphic Permutations
- The Number of Permutations Realized By a Shift
- A remark on morphic sturmian words
- Automatic Sequences
- Entropy of interval maps via permutations
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
- Factor complexity
- Infinite words with uniform frequencies, and invariant measures
This page was built for publication: Minimal complexity of equidistributed infinite permutations
