Factors of generalized Rudin-Shapiro sequences

zbMath0803.68096MaRDI QIDQ1326949

Mireille Bousquet-Mélou, Jean-Paul Allouche

Publication date: 15 June 1994

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226016

zbMATH Keywords

complexityalgebraic languagesrecurrence functionRudin-Shapiro sequencespaperfolding sequences\(k\)-powerfree words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (8)

About the \(p\)-paperfolding words ⋮ Uniform tag systems for paperfolding sequences ⋮ A New Approach to the Paperfolding Sequences ⋮ 2-Adic valuations of coefficients of certain integer powers of formal power series ⋮ Words avoiding repetitions in arithmetic progressions ⋮ Transcendence of formal power series with rational coefficients ⋮ Palindrome complexity. ⋮ Repetitions in Toeplitz words and the Thue threshold

This page was built for publication: Factors of generalized Rudin-Shapiro sequences