Lexicographically least words in the orbit closure of the Rudin-Shapiro word
From MaRDI portal
Publication:638548
DOI10.1016/J.TCS.2011.04.036zbMATH Open1223.68090arXiv0905.4923OpenAlexW2212932348MaRDI QIDQ638548FDOQ638548
Authors: James D. Currie
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0905.4923
Recommendations
- Extremal words in the shift orbit closure of a morphic sequence
- A tighter bound for the number of words of minimum length in an automorphic orbit.
- Counting words of minimum length in an automorphic orbit.
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Unary Words Have the Smallest Levenshtein k-Neighbourhoods
- A periodicity lemma for partial words
- On periodicity lemma for partial words
- Schützenberger and Eilenberg theorems for words on linear orderings
- Developments in Language Theory
Cites Work
Cited In (3)
This page was built for publication: Lexicographically least words in the orbit closure of the Rudin-Shapiro word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638548)