|
This article is cited in 5 scientific papers (total in 6 papers)
Growth functions, rewriting systems, and the Euler characteristic
R. I. Grigorchuk Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
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.
Received: 05.01.1995
Citation:
R. I. Grigorchuk, “Growth functions, rewriting systems, and the Euler characteristic”, Mat. Zametki, 58:5 (1995), 653–668
Linking options:
https://www.mathnet.ru/eng/mzm2085 https://www.mathnet.ru/eng/mzm/v58/i5/p653
|
Statistics & downloads: |
Abstract page: | 426 | Full-text PDF : | 178 | References: | 51 | First page: | 5 |
|