Abstract
We prove that all algebraic bases beta allow an eventually periodic representation of the elements of Q(beta) with a finite alphabet of digits A. Moreover, the classification of bases allowing that those representations have the so-called weak greedy property is given.
The decision problem whether a given pair (beta, A) allows eventually periodic representations proves to be rather hard, for it is equivalent to a topological property of the attractor of an iterated function system.