On permutations generated by infinite binary words

MaRDI QIDQ2371259zbMATH OpenFDO

Authors M. A. Makarov

Publication date 2 July 2007

Published in Sibirskie Elektronnye 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

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

Recommendations

• On infinite permutations
• On the infinite permutation generated by the period doubling word
• On automatic infinite permutations
• On periodicity and low complexity of infinite permutations
• On the permutations generated by Sturmian words

Cited in

(15)

• Permutation complexity of the Thue-Morse word
• Morphic words and equidistributed sequences
• Some permutations on Dyck words
• Combinatorial properties of infinite words associated with cut-and-project sequences
• Canonical representatives of morphic permutations
• On automatic infinite permutations
• On periodicity and low complexity of infinite permutations
• On the infinite permutation generated by the period doubling word
• On an infinite permutation similar to the Thue-Morse word
• Factor complexity and permutation complexity of the generalized Morse sequence
• scientific article; zbMATH DE number 7674557 (Why is no real title available?)
• Allowed patterns of symmetric tent maps via commuter functions
• Characterization of the allowed patterns of signed shifts
• On Ore’s Theorem and Universal Words for Permutations and Injections of Infinite Sets
• Permutations of \(\mathbb{N}\) generated by left-right filling algorithms

This page was built for publication: On permutations generated by infinite binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371259)