On permutations generated by infinite binary words

zbMath1150.68389MaRDI QIDQ2371259

M. A. Makarov

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

zbMATH Keywords

finite automatasuffix treeinfinite permutation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Related Items

Canonical Representatives of Morphic Permutations, On automatic infinite permutations, Minimal complexity of equidistributed infinite permutations, Allowed Patterns of Symmetric Tent Maps via Commuter Functions, Unnamed Item, On periodicity and low complexity of infinite permutations, Characterization of the allowed patterns of signed shifts, Permutation complexity of the Thue-Morse word, Morphic words and equidistributed sequences, Factor complexity and permutation complexity of the generalized Morse sequence, On the infinite permutation generated by the period doubling word, On an infinite permutation similar to the Thue-Morse word