@article{ITA_1990__24_1_1_0, author = {Allouche, J.-P. and Dress, F.}, title = {Tours de {Hano{\"\i}} et automates}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {1--15}, publisher = {EDP-Sciences}, volume = {24}, number = {1}, year = {1990}, mrnumber = {1060463}, zbl = {0701.68036}, language = {fr}, url = {http://archive.numdam.org/item/ITA_1990__24_1_1_0/} }
TY - JOUR AU - Allouche, J.-P. AU - Dress, F. TI - Tours de Hanoï et automates JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1990 SP - 1 EP - 15 VL - 24 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1990__24_1_1_0/ LA - fr ID - ITA_1990__24_1_1_0 ER -
Allouche, J.-P.; Dress, F. Tours de Hanoï et automates. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 1, pp. 1-15. http://archive.numdam.org/item/ITA_1990__24_1_1_0/
1. The Design and Analysis of Computers Algorithms, Addison-Wesley, Reading, MA, 1974, | MR | Zbl
, et ,2. Le construction de programmes structurés, Dunod, Paris, 1977. | Zbl
,3. Les bases de la programmation, Dunod, Paris, 1983. | Zbl
,4. Jeux et casse-tête à programmer, Dunod, Paris, 1985.
,5. The Cyclic Towers of Hanoï, Inform. Process. Lett., vol. 13, 1981, p. 118-119. | MR | Zbl
,6. Mathematical Recreations and Essays, McMillan, London, 1892. Voir aussi
,Mathematical Recreations and Essays, University of Toronto Press, Toronto, 1974, p. 316-317. | MR
et ,7. The Towers of Hanoï : an Exercise in Non Recursive Algorithm Development, Technical Report 80-103, Dept. of Computing and Information Science, Queen's University, 1980.
,8. Towers of Hanoï with More Pegs, J. Recreat. Math., vol. 8, (3), 1976, p. 165-176. | Zbl
,9. The Towers of Hanoï Problem, Inform. Process. Lett., vol. 10, 1980, p. 243-244. | MR | Zbl
et ,10. Suites algébriques, automates et substitutions, Bull. Soc. Math. France, vol. 108, 1980, p. 401-419. | Numdam | MR | Zbl
, , et ,11. La tour de Hanoï, jeu de calcul, Revue Science et Nature, vol. 1, n° 8, 1884, p. 127-128.
(anagramme de Lucas),12. Uniform Tag Sequences, Math. Syst. Theory, vol. 6, 1972, p. 164-192. | MR | Zbl
,13. Towers of Hanoï and Analysis of Algorithms, Amer. Math. Monthly, vol. 92, (6), June/July 1985. | MR | Zbl
et ,14. The Canterbury Puzzles, Thos. Nelson & Sons, 1919, réédition Dovers Publications Ltd, New York, 1958.
,15. The Trees of Hanoï, 1981, preprint.
,16. A Representation Approach to the Towers of Hanoï Problem, The Comput. J., 1982, p. 442-447. | Zbl
,17. An Iterative Solution to the Cyclic Towers of Hanoï Problem, Technical Report, Dept. of Computing Science, University of Wollogang, 1982.
,18. The Cyclic Towers of Hanoï : a Generalization, Technical Report, Dept. of Computing Science, University of Wollogang, 1982.
,19. A Generalization of the Cyclic Towers of Hanoï, Technical Report, Dept. of Computing Science, University of Wollogang, 1982.
,20. Towers of Hanoï with Black and White Discs, J. Inform. Optim. Sci., vol. 6, (1), 1985, p. 87-93. | MR
,21. The Towers of Hanoï and Binary Numerals, J. Inform. Optim. Sci., vol. 6, (2), 1985, p. 147-152. | MR | Zbl
,22. The Complexity of the Generalised Cyclic Towers of Hanoï, J. Algorithms, vol. 6, (3), 1985, p. 351-358. | MR | Zbl
,23. Pour en finir avec la dérécursivation du problème des tours de Hanoï, Actes Journée A.F.C.E.T. Combinatoire, Lyon-I, 1985.
,24. Solution of Problem n° 3918, Amer. Math. Monthly, vol. 48, 1941, p. 216-219. | MR
et ,25. Mathemaiical Puzzles and Diversions, Simon & Schuster, New York, 1958, p. 55-62.
,26. Mathematical Games : the CuriousPropertiesof the Gray Code and How it Can Be Used to Solve Puzzles, Sci. Amer., août 1972, p. 106-109.
,27. Time Complexity of the Towers of Hanoï Problem, SIGACT News, vol. 18, (1), 1986. | Zbl
et ,28. Génération de mots par des piles d'automates, 1985, preprint.
,29. A Note on the Towers of Hanoï Problem, The Comput. J., 1977, p. 282-285. | Zbl
,30. On 0-1 Sequences of Toeplitz Type, Z. Warsch. Geb., vol. 13, 1969, p. 123-131. | MR | Zbl
et ,31. The Generalized Towers of Hanoï (preprint), 1978.
et ,32. Note sur le problème des tours de Hanoï, Rev. Roumaine Math. pures et appl., vol. 30, 1985, p. 433-438. | MR | Zbl
,33. Méthodes de programmation, Eyrolles, Paris, 3e édition, 1984. | Zbl
et ,34. Three Variations on the Towers of Hanoï Problem, S. M. Thesis, University of Pennsylvania, 1983.
,35. A Family of Rules for Recursion Removal, 1986, preprint. | MR
et ,36. Cours de D.E.A. (communication privée), 1986.
,37. Recursion via Pascal, Cambridge University Press, 1984. | Zbl
,38. The Tower of Brahma Revisited, J. Recreat. Math., vol. 7, n° 2, 1974, p. 116-119.
,39. Avec des nombres et des lignes, Vuibert, Paris, 1942, p. 71-78.
,40. The Master Book of Mathematical Recreations, Dover Publications, Inc., New York, 1968, p. 119-121. | Zbl
,41. The Towers of Hanoï Revisited: Moving the Rings by Counting the Moves, Inform. Process. Lett., vol. 15, 1982, p. 64-67. | MR | Zbl
,42. The Towers of Brahma and Hanoï Revisited, J. Recreat. Math., vol. 14, n° 1, 1981, p. 17-24. | MR | Zbl
,