The number of factors in a paperfolding sequence
From MaRDI portal
Publication:3988182
DOI10.1017/S0004972700011655zbMath0753.11011MaRDI QIDQ3988182
Publication date: 28 June 1992
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
68R15: Combinatorics on words
11B83: Special sequences and polynomials
11B85: Automata sequences
Related Items
Schrödinger operators with Rudin-Shapiro potentials are not palindromic, Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics, On a group theoretic generalization of the Morse-Hedlund theorem, Multidimensional paperfolding systems, Cyclic complexity of words, Symmetry groups of infinite words, On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction, Canonical positions for the factors in paperfolding sequences, About the \(p\)-paperfolding words, Uniform tag systems for paperfolding sequences, Complexity of Toeplitz sequences, Palindrome complexity., Abelian antipowers in infinite words, Sequences of symmetry groups of infinite words, On triangular paperfolding patterns, The subword complexity of a class of infinite binary words, Words avoiding repetitions in arithmetic progressions, A New Approach to the Paperfolding Sequences, Sequences of low arithmetical complexity
Cites Work
