The automorphism cyclically permutes the first letter and leaves the remaining suffix unchanged, so and .
In the section notation,Thus . An automorphism satisfying fixes every finite word: repeatedly entering the third subtree eventually reaches the end of the word. Hence . Since , it is nonidentity, and both and have order three.
Articles by others on the same topic
There are currently no matching articles.