Abstract.
A cylinder is the set of infinite words with fixed prefix
u. A double-cylinder
is “the same” for bi-infinite
words. We show that for every word u and any automorphism
of the free group F the image
is a
finite union of cylinders. The analogous statement is true for
double cylinders. We give (a) an algorithm, and (b) a precise
formula which allows one to determine this finite union of
cylinders.
Received: 2012-04-02
Published Online: 2012-11-27
Published in Print: 2012-12-01
© 2012 by Walter de Gruyter Berlin Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Schlagwörter für diesen Artikel
Automorphisms of free groups;
cylinders;
Cooper cancellation bound