Quasiperiodic Sturmian words and morphisms

Authors:
F. Levé;G. Richomme
Affiliations:
LaRIA, Université de Picardie Jules Verne, 33, Rue Saint Leu, F-80039 Amiens cedex 1, France;LaRIA, Université de Picardie Jules Verne, 33, Rue Saint Leu, F-80039 Amiens cedex 1, France
Venue:
Theoretical Computer Science
Year:
2007

Citing 7
Cited 3

Optimal superprimitivity testing for strings

Information Processing Letters
Fibonacci morphisms and Sturmian words

Theoretical Computer Science
Efficient detection of quasiperiodicities in strings

Theoretical Computer Science
Infinite Lyndon words

Information Processing Letters
String pattern matching for a deluge survival kit

Handbook of massive data sets
Conjugacy and episturmian morphisms

Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Quasiperiodic and Lyndon episturmian words

Theoretical Computer Science
A local balance property of episturmian words

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Optimality of some algorithms to detect quasiperiodicities

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.