Note on the cyclic towers of Hanoi

DOI10.1016/0304-3975(94)90064-7MaRDI QIDQ1314396zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A generalization of the cyclic towers of hanoi: an iterative solution
• scientific article; zbMATH DE number 3922660
• Note on the Towers of Hanoi problem.
• A note on parallelism for the towers of Hanoi
• The towers of Hanoi problem with cyclic parallel moves
• An iterative algorithm for the cyclic Towers of Hanoi problem
• The cyclic multi-peg Tower of Hanoi
• The complexity of the generalised cyclic Towers of Hanoi problem
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

Cites work

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

Cited in

(8)

• A note on parallelism for the towers of Hanoi
• How to prove that a sequence is not automatic
• scientific article; zbMATH DE number 4173071 (Why is no real title available?)
• Tours de Hanoï et automates
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
• Hidden automatic sequences
• Developments in Language Theory
• How to do a half-turn in the cyclic tower of Hanoi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314396)