Uniform tag systems for paperfolding sequences

DOI10.1016/S0166-218X(97)84103-0zbMath0879.68072MaRDI QIDQ1364478

Christiane Bercoff

Publication date: 4 September 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A linear algorithm for string reconstruction in the reverse complement equivalence model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata in number theory
• Wire bending
• Mots sans carre et morphismes iterés
• Folded continued fractions
• Factors of generalized Rudin-Shapiro sequences
• Canonical positions for the factors in paperfolding sequences
• About the \(p\)-paperfolding words
• Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
• Hierarchie et fermeture de certaines classes de tag-systèmes
• Le p-pliage de papier
• Arithmetic and analytic properties of paper folding sequences
• Suites algébriques, automates et substitutions
• The number of factors in a paperfolding sequence
• A remark on morphic sturmian words
• A family of tag systems for paperfolding sequences
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences

This page was built for publication: Uniform tag systems for paperfolding sequences