Combinatorial properties of smooth infinite words
From MaRDI portal
Publication:818144
DOI10.1016/j.tcs.2005.12.003zbMath1116.11014MaRDI QIDQ818144
Dulucq, Serge, Laurent Vuillon, Srečko Brlek, A. Ladouceur
Publication date: 24 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.003
Related Items
Automata and differentiable words, The complexity of smooth words on 2-letter alphabets, Smooth words on 2-letter alphabets having same parity, Smooth words over arbitrary alphabets, Look and Say Fibonacci
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of \(C^{\infty}\)-words of each length
- On repeated factors in \(C^\infty\)-words
- Sturmian words: structure, combinatorics, and their arithmetics
- A note on differentiable palindromes.
- Enumeration of factors in the Thue-Morse word
- Palindromes and Sturmian words
- An Introduction to Symbolic Dynamics and Coding