About the \(p\)-paperfolding words
type: Item
instance of: scholarly article
title: About the \(p\)-paperfolding words
zbMATH Open document ID: 0871.68113
DOI: 10.1016/0304-3975(95)00008-9
author: Michel Koskas
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 11B85
zbMATH DE Number: 984389
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00008-9
OpenAlex ID: W2089683913
cites work: The number of factors in a paperfolding sequence
cites work: Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
cites work: On the complexity of infinite sequences
cites work: Canonical positions for the factors in paperfolding sequences
cites work: Factors of generalized Rudin-Shapiro sequences
cites work: Uniform tag sequences
cites work: Q5592246
cites work: Complexity of Toeplitz sequences
cites work: A result about languages concerning paperfolding sequences
cites work: Q4081195
cites work: Le p-pliage de papier
cites work: Q3798750
cites work: Q3764203
cites work: Some studies on the \((p,q)\)-type sequences
description: scientific article; zbMATH DE number 984389