The number of factors in a paperfolding sequence
Author:
- 1 August 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 46 (1) , 23-32
Abstract
We prove that the number of factors of length k in any paperfolding sequence is equal to 4k once k ≥ 7.Keywords
This publication has 12 references indexed in Scilit:
- Some combinatorial properties of the Thue–Morse sequence and a problem in semigroupsTheoretical Computer Science, 1989
- Enumeration of factors in the Thue-Morse wordDiscrete Applied Mathematics, 1989
- FoldsThe Mathematical Intelligencer, 1982
- Folds!°The Mathematical Intelligencer, 1982
- Arithmetic and analytic properties of paper folding sequencesBulletin of the Australian Mathematical Society, 1981
- Suites algébriques, automates et substitutionsBulletin de la Société Mathématiques de France, 1980
- Sequences with minimal block growthTheory of Computing Systems, 1973
- Uniform tag sequencesTheory of Computing Systems, 1972
- 0-1-sequences of Toeplitz typeProbability Theory and Related Fields, 1969
- Symbolic DynamicsAmerican Journal of Mathematics, 1938