Translation algorithms for graph covers

Abstract

Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\ non-minimality or aperiodicty are no restrictions). We give a survey on the construction, properties and some special cases of graph covers.