An automaton group with undecidable order and Engel problems

The above group also has an undecidable Engel problem: there is no algorithm that, given g,h in the group, decides whether there exists an integer n such that the n-iterated commutator […[[g,h],h],…,h] is the identity or not. This solves a problem raised by Bartholdi.