The word problem in Hanoi Towers groups

zbMath1328.20053arXiv1409.0119MaRDI QIDQ5178711

Ievgen V. Bondarenko

Publication date: 16 March 2015

Full work available at URL: https://arxiv.org/abs/1409.0119

zbMATH Keywords

automata groupscomplexity of word problemTowers of Hanoi game

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items (3)

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Key agreement based on automaton groups ⋮ An automaton group with \textsf{PSPACE}-complete word problem

This page was built for publication: The word problem in Hanoi Towers groups