About the \(p\)-paperfolding words

DOI10.1016/0304-3975(95)00008-9zbMath0871.68113OpenAlexW2089683913MaRDI QIDQ1351443

Michel Koskas

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00008-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (1)

Uniform tag systems for paperfolding sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some studies on the \((p,q)\)-type sequences
• On the complexity of infinite sequences
• Factors of generalized Rudin-Shapiro sequences
• Canonical positions for the factors in paperfolding sequences
• Complexity of Toeplitz sequences
• Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
• Le p-pliage de papier
• The number of factors in a paperfolding sequence
• A result about languages concerning paperfolding sequences
• Uniform tag sequences

This page was built for publication: About the \(p\)-paperfolding words