On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers (Q355379): Difference between revisions

Summary: We study the conjugacy problem in the automorphism group \(\Aut(T)\) of a regular rooted tree \(T\) and in its subgroup \(\mathrm F\Aut(T)\) of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the orbit-signalizer, two finite-state automorphisms are conjugate in \(\Aut(T)\) if and only if they are conjugate in \(\mathrm F\Aut(T)\), and that this problem is decidable. We prove that both conditions are satisfied by bounded automorphisms and establish that the (simultaneous) conjugacy problem in the group of bounded automata is decidable.