The word problem in Hanoi Towers groups

被引:0
|
作者
Bondarenko, Ievgen [1 ]
机构
[1] Natl Tams Shevchenko Univ Kyiv, Mech & Math Fac, Dept Algebra & Math Log, Vul Volodymyrska 64, UA-11033 Kiev, Ukraine
来源
ALGEBRA & DISCRETE MATHEMATICS | 2014年 / 17卷 / 02期
关键词
the Tower of Hanoi game; automaton group; word problem; complexity;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We prove that the elements of the Hanoi Towers groups H-m, have depth bounded from above by a poly-logarithmic function 0(log(m-2) n), where a is the length or an element. Therefore the word problem in groups H-m is solvable in subexponential tirne exp(O(log(m-2)n)).
引用
收藏
页码:248 / 255
页数:8
相关论文
共 50 条
  • [1] THE TOWERS OF HANOI PROBLEM
    ROHL, JS
    COMPUTER JOURNAL, 1985, 28 (03): : 350 - 350
  • [2] THE TOWERS OF HANOI PROBLEM
    BUNEMAN, P
    LEVY, L
    INFORMATION PROCESSING LETTERS, 1980, 10 (4-5) : 243 - 244
  • [3] On the solution of the towers of Hanoi problem
    Ahrabian, Hayedeh
    Badamchi, Comfar
    Nowzari-Dalini, Abbass
    World Academy of Science, Engineering and Technology, 2011, 73 : 89 - 92
  • [4] NOTE ON TOWERS OF HANOI PROBLEM
    HAYES, PJ
    COMPUTER JOURNAL, 1977, 20 (03): : 282 - 285
  • [5] THE TOWERS OF HANOI PROBLEM WITH PARALLEL MOVES
    WU, JS
    CHEN, RJ
    INFORMATION PROCESSING LETTERS, 1992, 44 (05) : 241 - 243
  • [6] A FAST ALGORITHM FOR THE TOWERS OF HANOI PROBLEM
    GAULT, D
    CLINT, M
    COMPUTER JOURNAL, 1987, 30 (04): : 376 - 378
  • [7] AN ANALYSIS OF THE GENERALIZED TOWERS OF HANOI PROBLEM
    ER, MC
    BIT, 1983, 23 (04): : 429 - 435
  • [8] The associativity of equivalence and the Towers of Hanoi problem
    Backhouse, R
    Fokkinga, M
    INFORMATION PROCESSING LETTERS, 2001, 77 (2-4) : 71 - 76
  • [9] MODIFIED HANOI TOWERS GROUPS AND LIMIT SPACES
    Makisumi, Shotaro
    Stadnyk, Grace
    Steinhurst, Benjamin
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2011, 21 (06) : 867 - 887
  • [10] Memory Saving for Solving the Towers of Hanoi Problem
    Fang, Chen-An
    Chen, Yu-Kumg
    WMSCI 2008: 12TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, PROCEEDINGS, 2008, : 36 - 38