Episturmian words and some constructions of de Luca and Rauzy

By Xavier Droubay, J. Justin, G. Pirillo. Theoretical Computer Science, 2001

320 citations recorded by the source corpus.

Abstract In this paper we study infinite episturmian words which are a natural generalization of Sturmian words to an arbitrary alphabet. A characteristic property is: they are closed under reversal and have at most one right special factor of each length. They are first obtained by a construction due to de LUCA which utilizes the palindrome closure. They can also be obtained by the way of extended RAUZY rules.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/68115441030d55255a3fd65a4b0f904905a45906

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Jean Berstel
2. David Damanik

In Computational Theory and Mathematics

1. Jean Berstel
2. David Damanik

Citations in the corpus

• Sturmian and episturmian words: a survey of some recent results (2007, background): “[37,23,5,38] A word is a Sturmian palindrome if and only if it is a median factor of a central word.”
• Strictly Ergodic Subshifts and Associated Operators (2005, result): “See [63, 88, 122, 137] for these results and more information on Arnoux-Rauzy and episturmian subshifts.”