On periodicity and low complexity of infinite permutations
From MaRDI portal
Publication:2461768
DOI10.1016/j.ejc.2007.04.017zbMath1126.05004MaRDI QIDQ2461768
Anna E. Frid, Dmitry G. Fon-Der-Flaass
Publication date: 21 November 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.04.017
05A05: Permutations, words, matrices
Related Items
Central sets generated by uniformly recurrent words, On a generalization of abelian equivalence and complexity of infinite words, Characterization of the allowed patterns of signed shifts, Infinite permutations of lowest maximal pattern complexity, Permutation complexity of the Thue-Morse word, On the permutation complexity of the Cantor-like sequences, On the infinite permutation generated by the period doubling word, On an infinite permutation similar to the Thue-Morse word, Minimal complexity of equidistributed infinite permutations, PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP, On automatic infinite permutations, Canonical Representatives of Morphic Permutations
Cites Work