THE NUMBER OF FACTORS IN A PAPERFOLDING SEQUENCE

被引：23

作者：

ALLOUCHE, JP ^{[1
]}

机构：

[1] CNRS,URA 0226,351 COURS LIBERAT,F-33405 TALENCE,FRANCE

来源：

关键词：

D O I：

10.1017/S0004972700011655

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that the number of factors of length k in any paperfolding sequence is equal to 4k once k greater-than-or-equal-to 7.

引用

页码：23 / 32

页数：10

共 18 条

[1]

ALLOUCHE JP, 1991, ACTA ARITH, V60, P1

[2]

ALLOUCHE JP, 1991, C THEMATE LUMINY

[3]

BLANCHARD A, 1982, B SCI MATH, V106, P325

[4] ENUMERATION OF FACTORS IN THE THUE-MORSE WORD [J].

BRLEK, S .

[5]

CHRISTOL G, 1980, B SOC MATH FR, V108, P401

[6]

Cobham A., 1972, MATH SYSTEMS THEORY, V6, P164, DOI 10.1007/BF01706087

[7]

Coven Ethan M., 1973, MATH SYSTEMS THEORY, V7, P138

[8]

Dekking F.M., 1982, MATH INTELL, V4, P130, DOI [10.1007/BF03024244, DOI 10.1007/BF03024244]

[9]

Dekking F.M., 1982, MATH INTELL, V4, P190

DELUCA, A ;

VARRICCHIO, S .