Monogenic free inverse semigroups and partial automorphisms of regular rooted trees

For a one-to-one partial mapping on an infinite set, we present a criterion in terms of its cycle-chain decomposition that the inverse subsemigroup generated by this mapping is monogenic free inverse. We also give a sufficient condition for a regular rooted tree partial automorphism to extend to a partial automorphism of another regular rooted tree so that the inverse semigroup gene\-ra\-ted by this extended partial automorphism is monogenic free inverse. The extension procedure we develop is then applied to n -ary adding machines.