Smooth words on 2-letter alphabets having same parity
From MaRDI portal
Publication:2481962
DOI10.1016/j.tcs.2007.11.019zbMath1136.68044OpenAlexW2083259384MaRDI QIDQ2481962
Geneviève Paquin, Damien Jamet, Srečko Brlek
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.019
Related Items (4)
Functional stepped surfaces, flips, and generalized substitutions ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ The stable set of a self-map
Cites Work
- Substitutions in dynamics, arithmetics and combinatorics
- Proceedings of the 17th international conference on formal power series and algebraic combinatorics, FPSAC '05, and Garsia Fest, Taormina, Sicily, Italy, June 20--25, 2005
- Combinatorial properties of smooth infinite words
- On the number of \(C^{\infty}\)-words of each length
- Infinite Lyndon words
- On repeated factors in \(C^\infty\)-words
- A note on differentiable palindromes.
- Enumeration of factors in the Thue-Morse word
- Smooth words over arbitrary alphabets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Smooth words on 2-letter alphabets having same parity
