Uniform tag systems for paperfolding sequences

被引:1
|
作者
Bercoff, C
机构
[1] LaRIA, Univ. de Picardie Jules Verne, 80039 Amiens Cedex
关键词
automata; automatic sequence;
D O I
10.1016/S0166-218X(97)84103-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
One folds lengthwise a strip of paper in p greater than or equal to 2 equal parts several times on itself (all folds being parallel). After unfolding, one obtains a sequence of ''valley'' and ''ridge'' folds. If one codes these folds over a two-letter alphabet, one obtains a p-paperfolding word associated with the sequence of p-folding instructions. A p-paperfolding sequence is an infinite p-paperfolding word. This paper is devoted to the effective construction of p-uniform tag systems which generate every p-paperfolding sequence associated with ultimately periodic sequence of p-(un)folding instructions.
引用
收藏
页码:119 / 138
页数:20
相关论文
共 50 条