The number of factors in a paperfolding sequence

DOI10.1017/S0004972700011655zbMath0753.11011MaRDI QIDQ3988182

Jean-Paul Allouche

Publication date: 28 June 1992

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

substring enumerationdigital sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Special sequences and polynomials (11B83) Automata sequences (11B85)

Related Items (19)

Canonical positions for the factors in paperfolding sequences ⋮ Symmetry groups of infinite words ⋮ The subword complexity of a class of infinite binary words ⋮ About the \(p\)-paperfolding words ⋮ Uniform tag systems for paperfolding sequences ⋮ A New Approach to the Paperfolding Sequences ⋮ Complexity of Toeplitz sequences ⋮ On triangular paperfolding patterns ⋮ Schrödinger operators with Rudin-Shapiro potentials are not palindromic ⋮ Cyclic complexity of words ⋮ Multidimensional paperfolding systems ⋮ Words avoiding repetitions in arithmetic progressions ⋮ Abelian antipowers in infinite words ⋮ Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics ⋮ On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction ⋮ Sequences of low arithmetical complexity ⋮ Sequences of symmetry groups of infinite words ⋮ Palindrome complexity. ⋮ On a group theoretic generalization of the Morse-Hedlund theorem

Cites Work

• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Folds!
• Enumeration of factors in the Thue-Morse word
• 0-1-sequences of Toeplitz type
• Uniform tag sequences
• Sequences with minimal block growth
• Symbolic Dynamics

This page was built for publication: The number of factors in a paperfolding sequence