Pages that link to "Item:Q3988182"
From MaRDI portal
The following pages link to The number of factors in a paperfolding sequence (Q3988182):
Displaying 20 items.
- Cyclic complexity of words (Q507796) (← links)
- Symmetry groups of infinite words (Q832947) (← links)
- Folds! (Q1168345) (← links)
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction (Q1277184) (← links)
- Canonical positions for the factors in paperfolding sequences (Q1329729) (← links)
- About the \(p\)-paperfolding words (Q1351443) (← links)
- Uniform tag systems for paperfolding sequences (Q1364478) (← links)
- Complexity of Toeplitz sequences (Q1382825) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Abelian antipowers in infinite words (Q2002043) (← links)
- Sequences of symmetry groups of infinite words (Q2092398) (← links)
- On triangular paperfolding patterns (Q2198993) (← links)
- The subword complexity of a class of infinite binary words (Q2370831) (← links)
- Words avoiding repetitions in arithmetic progressions (Q2474231) (← links)
- A New Approach to the Paperfolding Sequences (Q3195678) (← links)
- Sequences of low arithmetical complexity (Q3423138) (← links)
- Schrödinger operators with Rudin-Shapiro potentials are not palindromic (Q4340141) (← links)
- Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics (Q5227735) (← links)
- On a group theoretic generalization of the Morse-Hedlund theorem (Q5270140) (← links)
- Multidimensional paperfolding systems (Q5406874) (← links)
