메뉴 건너뛰기




Volumn 20, Issue 3, 2006, Pages 610-622

Shortest paths in the tower of Hanoi graph and finite automata

Author keywords

Finite automata; Sierpi ski gasket; Tower of Hanoi

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FINITE AUTOMATA; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 34547889538     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050628660     Document Type: Article
Times cited : (71)

References (13)
  • 2
    • 13944249452 scopus 로고
    • A statistical analysis of the Towers of Hanoi problem
    • T. CHAN, A statistical analysis of the Towers of Hanoi problem, Internat. J. Comput. Math., 28 (1988), pp. 543-623.
    • (1988) Internat. J. Comput. Math , vol.28 , pp. 543-623
    • CHAN, T.1
  • 3
    • 0020994736 scopus 로고
    • An analysis of the generalized Towers of Hanoi problem
    • M. C. ER, An analysis of the generalized Towers of Hanoi problem, BIT, 23 (1983), pp. 429-435.
    • (1983) BIT , vol.23 , pp. 429-435
    • ER, M.C.1
  • 5
    • 0000365197 scopus 로고
    • The Tower of Hanoi
    • A. HINZ, The Tower of Hanoi, Enseign. Math., 35 (1989), pp. 289-321.
    • (1989) Enseign. Math , vol.35 , pp. 289-321
    • HINZ, A.1
  • 6
    • 38249008370 scopus 로고
    • Shortest paths between regular states of the Tower of Hanoi
    • A. HINZ, Shortest paths between regular states of the Tower of Hanoi, Inform. Sci., 63 (1992), pp. 173-181.
    • (1992) Inform. Sci , vol.63 , pp. 173-181
    • HINZ, A.1
  • 7
    • 9444257338 scopus 로고    scopus 로고
    • Algebras and Combinatorics ICAC'97, Hong Kong, Springer, Singapore
    • A. HINZ, The Tower of Hanoi, in Algebras and Combinatorics (ICAC'97, Hong Kong), Springer, Singapore, 1999, pp. 277-289.
    • (1999) The Tower of Hanoi , pp. 277-289
    • HINZ, A.1
  • 8
    • 13944254486 scopus 로고    scopus 로고
    • Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
    • A. HINZ, S. KLAVZAR, U. MILUTINOVIC, D. PARISSE, AND C PETR, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, European J. Combin., 26 (2005), pp. 693-708.
    • (2005) European J. Combin , vol.26 , pp. 693-708
    • HINZ, A.1    KLAVZAR, S.2    MILUTINOVIC, U.3    PARISSE, D.4    PETR, C.5
  • 9
    • 0010198065 scopus 로고
    • The average distance on the Sierpiński gasket
    • A. HINZ AND A. SCHIEF, The average distance on the Sierpiński gasket, Probab. Theory Related Fields, 87 (1990), pp. 129-138.
    • (1990) Probab. Theory Related Fields , vol.87 , pp. 129-138
    • HINZ, A.1    SCHIEF, A.2
  • 10
    • 0032337920 scopus 로고    scopus 로고
    • Graphs S(n, k) and a variant of the Tower of Hanoi problem
    • S. KLAVZAR AND U. MILUTINOVIC, Graphs S(n, k) and a variant of the Tower of Hanoi problem, Czechoslovak Math. J., 47 (1997), pp. 95-104.
    • (1997) Czechoslovak Math. J , vol.47 , pp. 95-104
    • KLAVZAR, S.1    MILUTINOVIC, U.2
  • 11
    • 84867954004 scopus 로고    scopus 로고
    • On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
    • S. KLAVZAR, U. MILUTINOVIC, AND C PETR, On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem, Discrete Appl. Math., 120 (2002), pp. 141-157.
    • (2002) Discrete Appl. Math , vol.120 , pp. 141-157
    • KLAVZAR, S.1    MILUTINOVIC, U.2    PETR, C.3
  • 12
    • 13944265914 scopus 로고
    • Le lion, le lama et la laitue
    • I. STEWART, Le lion, le lama et la laitue, Pour la Science, 142 (1989), pp. 102-107.
    • (1989) Pour la Science , vol.142 , pp. 102-107
    • STEWART, I.1
  • 13
    • 34547915504 scopus 로고    scopus 로고
    • P. K. STOCKMEYER, The Tower of Hanoi: A Historical Survey and Bibliography, version 0.2, preprint, 2001. Available online from
    • P. K. STOCKMEYER, The Tower of Hanoi: A Historical Survey and Bibliography, version 0.2, preprint, 2001. Available online from http://www.cs.wm.edu/~pkstoc/h_papers.html.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.