G. Barat, T. Downarowicz, A. Iwanik, and P. Liardet, Proprié tés topologiques et combinatoires des échelles de numération, Colloq. Math. 84/85 (2000), 285-306.
G. Barat and P. J. Grabner, Distribution properties of G-additive functions, J. Number Theory 60 (1996), 103-123.
H. Baumgärtel, Endlichdimensionale analytische. Störungstheorie, Mathematische Lehrbücher und Monographien, II. Abteilung. Mathematische Monographien, Band 28, Akademie-Verlag, Berlin, 1972.
V. Berthé and M. Rigo, Odometers on regular languages, to appear in Theory Comput. Systems, DOI: 10.1007/s00224-005-1215-5.
A. Bertoni, C. Choffrut, M. Goldwurm, and V. Lonati, On the number of occurrences of a symbol in words of regular languages, Theoret. Comput. Sci. 302 (2003), 431-456.
V. Bruyère and G. Hansel, Bertrand numeration systems and recognizability, Theoret. Comput. Sci. 181 (1997), 17-43.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, second edition, MIT Press, Cambridge, MA, 2001.
D. de Falco, M. Gold wurm, and V. Lonati, Frequency of symbol occurrences in bicomponent stochastic models, Theoret. Comput. Sd. 327 (2004), 269-300.
H. Delange, Sur les fonctions q-additive ou q-multiplicatives, Acta Arith. 21 (1972), 285-298.
H. Delange, Sur la fonction sommatoire de la fonction "Somme des Chiffres", Enseign. Math. (2) 21 (1975), 31-47.
M. Drmota, q-Additive functions and well distribution, Demonstratic. Math. 30 (1997), 883-896.
M. Drmota and J. Gajdosik, The distribution of the sum-of-digits function, J. Theor. Nombres Bordeaux 10 (1998), 17-32.
J.-M. Dumont and A. Thomas, Digital sum problems and substitutions on a finite alphabet, J. Number Theoiy 39 (1991), 351-366.
J.-M. Dumont and A. Thomas, Digital sum moments and substitutions, Acta Arith. 64 (1993), 205-225.
J.-M. Dumont and A. Thomas, Gaussian asymptotic properties of the sum-of-digits function, J. Number Theory 62 (1997), 19-38.
S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.
P. Flajolet, P. J. Grabner, P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Mellin transforms and asymptotics: digital sums, Theoret. Comput. Sci. 123 (1994), 291-314.
C. Frougny, Representation of numbers and finite automata, Math. Systems Theory 25 (1992), 37-60.
C. Frougny, Numeration systems, in [28], Chapter 7, 2002.
P. J. Grabner, P. Liardet, and R. F. Tichy, Odometers and systems of numeration, Acta Arith. 70 (1995), 103-123.
P. J. Grabner and M. Rigo, Additive functions with respect to numeration systems on regular languages, Monatsh. Math. 139 (2003), 205-219.
P. J. Grabner and R. F. Tichy, Contributions to digit expansions with respect to linear recurrences, J. Number Theory 36 (1990), 160-169.
P. J. Grabner and R. F. Tichy, a-Expansions, linear recurrences and the sum-of-digits function, Manuscripta Math. 70 (1991), 311-324.
D. E. Knuth, The An of Computer Programming, Vol. 1 : Fundamental Algorithms, Addison-Wesley, Reading, MA, 1977.
P. Lecomte and M. Rigo, Numeration systems on a regular language, Theory Comput. Systems 34 (2001), 27-44.
D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1995.
M. Loève, Probability Theory, third edition, Van Nostrand, Princeton, NJ, 1963.
M. Lothaire, Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, no. 90, Cambridge University Press, Cambridge, 2002.
E. Seneta, Non-Negative Matrices, An introduction to Theory and Applications, Halsted Press, New York, 1973.
