A New Approach to the Paperfolding Sequences

DOI10.1007/978-3-319-20028-6_4zbMath1459.68163OpenAlexW1168124290MaRDI QIDQ3195678

Daniel Goč, Luke Schaeffer, Hamoon Mousavi, Jeffrey O. Shallit

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_4

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (1)

Properties of a class of Toeplitz words

Cites Work

• Unnamed Item
• Infinite 0-1 sequences without long adjacent identical blocks
• Folds!
• Factors of generalized Rudin-Shapiro sequences
• Canonical positions for the factors in paperfolding sequences
• Periodicity, repetitions, and orbits of an automatic sequence
• Words avoiding repetitions in arithmetic progressions
• Automatic Theorem-Proving in Combinatorics on Words
• The number of factors in a paperfolding sequence
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Uniform tag sequences

This page was built for publication: A New Approach to the Paperfolding Sequences