Note on the cyclic towers of Hanoi

DOI10.1016/0304-3975(94)90064-7zbMath0801.68068OpenAlexW2068412380MaRDI QIDQ1314396

Jean-Paul Allouche

Publication date: 22 February 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90064-7

zbMATH Keywords

automatic sequencescyclic towers of Hanoi

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Automata sequences (11B85)

Related Items (2)

How to prove that a sequence is not automatic ⋮ Hidden automatic sequences

Cites Work

• Substitution dynamical systems - spectral analysis
• The cyclic towers of Hanoi
• Tours de Hanoï et automates
• The spectrum of dynamical systems arising from substitutions of constant length
• Uniform tag sequences

This page was built for publication: Note on the cyclic towers of Hanoi