| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437347 | Theoretical Computer Science | 2011 | 5 Pages |
Abstract
We give an effective characterization of the lexicographically least word in the orbit closure of the Rudin–Shapiro word having a specified prefix. In particular, the lexicographically least word in the orbit closure of the Rudin–Shapiro word is . This answers a question Allouche et al. (Theoretical Computer Science 2009).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
