On permutations generated by infinite binary words
From MaRDI portal
Publication:2371259
zbMath1150.68389MaRDI QIDQ2371259
Publication date: 2 July 2007
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/54783
68R05: Combinatorics in computer science
68R15: Combinatorics on words
05A05: Permutations, words, matrices
68Q45: Formal languages and automata
Related Items
Unnamed Item, Characterization of the allowed patterns of signed shifts, 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, Morphic words and equidistributed sequences, Factor complexity and permutation complexity of the generalized Morse sequence, Minimal complexity of equidistributed infinite permutations, On periodicity and low complexity of infinite permutations, On automatic infinite permutations, Allowed Patterns of Symmetric Tent Maps via Commuter Functions, Canonical Representatives of Morphic Permutations