Advanced search
Publication Cover
The American Mathematical Monthly Volume 101, 1994 - Issue 7
Submit an article Journal homepage
17
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Morphisms, Squarefree Strings, and the Tower of Hanoi Puzzle

Jean-Paul Allouche Allouche: C.N.R.S., L.M.D. Luminy Case 930 F-13288, Marseille, Cedex 9, [email protected]
,
Dan Astoorian Astoorian: Mississauga, Ontario, [email protected]
,
Jim Randall Randall: Waterloo, Ontario, [email protected]
&
Jeffrey Shallit Shallit: Department of Computer ScienceUniversity of WaterlooWaterloo, Ontario, N2L 3G1, [email protected]
Pages 651-658 | Published online: 18 Apr 2018

REFERENCES

  • J.-P. Allouche. Automates finis en théorie des nombres. Expo. Math. 5 (1987), 239–266.
  • J.-P. Allouche, D. Astoorian, and J. Shallit. The Towers of Hanoi and kth-power-free words. In preparation.
  • J.-P. Allouche, J. Betrema, and J. Shallit, Sur des points fixes de morphismes du monoide libre. RAIRO Informatique Théorique 23 (1989), 235–249.
  • J.-P. Allouche and F. Dress. Tours de Hanoi et automates. RAIRO Informatique Théorique et Applications 24 (1990), 1–15.
  • D. A. Bean, G. Ehrenfeucht, and G. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math. 85 (1979), 261–294.
  • J. Berstel. Some recent results on squarefree words. In M. Fontet and K. Mehlhorn, editors, STACS '84, Vol. 166 of Lecture Notes in Computer Science, pages 14–25. Springer-Verlag, 1984.
  • A. Cobham. Uniform tag sequences. Math. Systems Theory 6 (1972), 164–192.
  • P. Cull and C. Gerety. Is Towers of Hanoi really hard? Congr. Numer. 47 (1985), 237–242.
  • F. M. Dekking, M. Mendès France, and A. J. van der Poorten. Folds! Math. Intelligencer 4 (1982), 130–138, 173–181, 190–195.
  • J. S. Frame and B. M. Stewart. Solution of problems 3918. Amer. Math. Monthly 48 (1941), 216–219.
  • R. K. Guy. Unsolved Problems in Number Theory, Vol. I of Unsolved Problems in Intuitive Mathematics. Springer-Verlag, New York, 1981.
  • A. M. Hinz. The tower of Hanoi. Enseign. Math. 35 (1989), 289–321.
  • M. Lothaire. Combinatorics on Words, Vol. 17 of Encyclopedia of Mathematics and Its Applications. Addison-Wesley, 1983.
  • E. Lucas. Le calcul et les machines à calculer. Assoc. Française pour l'Avancement des Sciences; Comptes Rendus 13 (1884), 111–141.
  • M. Morse. Recurrent geodesies on a surface of negative curvature. Trans. Amer. Math. Soc. 22 (1921), 84–100.
  • E. Prouhet. Mémoire sur quelques relations entre les puissances des nombres. C. R. Acad. Sci. Paris 33 (1851), 225.
  • R. S. Scorer, P. M. Grundy, and C. A. B. Smith. Some binary games. Math. Gazette 28 (1944), 96–103.
  • A. Thue. Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana 7 (1906), 1–22. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetaforlaget, Oslo, 1977.
  • D. Wood. The towers of Brahma and Hanoi revisited. J. Recreational Math. 14 (1981), 17–24.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.