Infinite self-shuffling words

DOI10.1016/j.jcta.2014.07.008zbMath1309.68161arXiv1302.3844OpenAlexW2050080033MaRDI QIDQ458277

Luca Q. Zamboni, Svetlana Puzynina, Émilie Charlier, Teturo Kamae

Publication date: 7 October 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3844

zbMATH Keywords

Sturmian wordsLyndon wordsmorphic wordsThue-Morse wordword shuffling

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

A characterization of binary morphisms generating Lyndon infinite words, Aperiodic pseudorandom number generators based on infinite words, Abelian combinatorics on words: a survey, Abelian bordered factors and periodicity, On shuffling of infinite square-free words, Expansions of generalized Thue-Morse numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite Lyndon words
• Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• A characterization of substitutive sequences using return words
• Sturmian words: structure, combinatorics, and their arithmetics
• Unshuffling a square is NP-hard
• MINIMAL DUVAL EXTENSIONS
• A little more about morphic Sturmian words
• Automatic Sequences
• A generalization of Sturmian sequences: Combinatorial structure and transcendence
• On Recognizing Words That Are Squares for the Shuffle Product
• Self-shuffling Words
• On substitution invariant Sturmian words: an application of Rauzy fractals