Complexity of generalized Rudin-Shapiro sequences
From MaRDI portal
Publication:1320516
DOI10.5802/jtnb.94zbMath0817.11014OpenAlexW2327557392MaRDI QIDQ1320516
Jeffrey O. Shallit, Jean-Paul Allouche
Publication date: 8 August 1995
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_1993__5_2_283_0
Related Items
Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach ⋮ Euclidean strings ⋮ Spectral continuity for aperiodic quantum systems: Applications of a folklore theorem ⋮ On the Shyr-Yu theorem ⋮ Unnamed Item
Cites Work
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Automata calculating the complexity of automatic sequences
- Enumeration of factors in the Thue-Morse word
- Some Theorems on Fourier Coefficients
- Suites algébriques, automates et substitutions
- Generalized Rudin-Shapiro sequences
- Représentation géométrique de suites de complexité $2n+1$
- Uniform tag sequences
- Sequences with minimal block growth
