A note on differentiable palindromes

Authors:
S. Brlek;A. Ladouceur
Affiliations:
Dept. Informatique, LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale "Centre-Ville", Montréal Que, Canada H3C 3P8;Dept. Informatique, LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale "Centre-Ville", Montréal Que, Canada H3C 3P8
Venue:
Theoretical Computer Science
Year:
2003

Citing 5
Cited 9

On the number of C∞-words of each length

Journal of Combinatorial Theory Series A
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
Palindromes and Sturmian words

Theoretical Computer Science
Palindrome complexity

Theoretical Computer Science

Combinatorial properties of smooth infinite words

Theoretical Computer Science
Smooth words over arbitrary alphabets

Theoretical Computer Science
Smooth words on 2-letter alphabets having same parity

Theoretical Computer Science
Note: About the number of C∞-words of form~wxw

Theoretical Computer Science
The complexity of Cbw-words of the form w×w

Theoretical Computer Science
A note on the complexity of C∞-words

Theoretical Computer Science
Note: Complexity and palindromic defect of infinite words

Theoretical Computer Science
The complexity of smooth words on 2-letter alphabets

Theoretical Computer Science
Automata and differentiable words

Theoretical Computer Science

Quantified Score

Hi-index	5.24

Visualization

Abstract

Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties ...