Growth functions, rewriting systems, and the Euler characteristic
Matematičeskie zametki, Tome 58 (1995) no. 5, pp. 653-668
Voir la notice de l'article provenant de la source Math-Net.Ru
We present a formula that expresses the number of admissible words for an arbitrary system of prohibitions in terms of the generating series. We also indicate applications of this formula to the calculation of the topological entropy of symbolic systems and to the calculation of growth functions of groups and algebras.
@article{MZM_1995_58_5_a1,
author = {R. I. Grigorchuk},
title = {Growth functions, rewriting systems, and the {Euler} characteristic},
journal = {Matemati\v{c}eskie zametki},
pages = {653--668},
publisher = {mathdoc},
volume = {58},
number = {5},
year = {1995},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1995_58_5_a1/}
}
R. I. Grigorchuk. Growth functions, rewriting systems, and the Euler characteristic. Matematičeskie zametki, Tome 58 (1995) no. 5, pp. 653-668. http://geodesic.mathdoc.fr/item/MZM_1995_58_5_a1/