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/}
}
TY  - JOUR
AU  - R. I. Grigorchuk
TI  - Growth functions, rewriting systems, and the Euler characteristic
JO  - Matematičeskie zametki
PY  - 1995
SP  - 653
EP  - 668
VL  - 58
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1995_58_5_a1/
LA  - ru
ID  - MZM_1995_58_5_a1
ER  - 
%0 Journal Article
%A R. I. Grigorchuk
%T Growth functions, rewriting systems, and the Euler characteristic
%J Matematičeskie zametki
%D 1995
%P 653-668
%V 58
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1995_58_5_a1/
%G ru
%F 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/