Abstract
A cylinder is the set of infinite words with fixed prefix . A double-cylinder is "the same" for bi-infinite words. We show that for every word and any automorphism of the free group 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.