This paper is a contribution to the general tiling problem for the hyperbolic plane. It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264] and the conjecture that the problem is undecidable.
For abstract numeration systems built on exponential regular languages (including those coming from substitutions), we show that the set of real numbers having an ultimately periodic representation is if the dominating eigenvalue of the automaton accepting the language is a Pisot number. Moreover, if is neither a Pisot nor a Salem number, then there exist points in which do not have any ultimately periodic representation.