A note on differentiable palindromes.

DOI10.1016/S0304-3975(02)00746-6zbMath1044.68140OpenAlexW2039091701MaRDI QIDQ1401323

A. Ladouceur, Srečko Brlek

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00746-6

zbMATH Keywords

Kolakoski wordRecurrenceCombinatorics on wordsPalindrome complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

Combinatorial properties of smooth infinite words ⋮ Complexity and palindromic defect of infinite words ⋮ Automata and differentiable words ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS ⋮ Smooth words on 2-letter alphabets having same parity ⋮ About the number of \(C^\infty \)-words of form \(\widetilde wxw \) ⋮ A note on the complexity of \(C^{\infty }\)-words ⋮ The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) ⋮ Smooth words over arbitrary alphabets

Cites Work

• On the number of \(C^{\infty}\)-words of each length
• Sturmian words: structure, combinatorics, and their arithmetics
• Enumeration of factors in the Thue-Morse word
• Palindromes and Sturmian words
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on differentiable palindromes.