Note: Lexicographically least words in the orbit closure of the Rudin-Shapiro word

Authors:
James Currie
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2011

Citing 5
Cited 0

On the structure and extendibility of k-power free words

European Journal of Combinatorics
Cantor sets and Dejean's conjecture

Journal of Automata, Languages and Combinatorics - Special issue: Second international conference developments in language theory
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
The set of k-power free words over ∑ is empty or perfect

European Journal of Combinatorics
Periodicity, repetitions, and orbits of an automatic sequence

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give an effective characterization of the lexicographically least word in the orbit closure of the Rudin-Shapiro word w having a specified prefix. In particular, the lexicographically least word in the orbit closure of the Rudin-Shapiro word is 0w. This answers a question Allouche et al. (Theoretical Computer Science 2009).