×

Circular codes, loop counting, and zeta-functions. (English) Zbl 0718.94013

We prove a simple formula for the zeta function of coded systems generated by circular codes (and more generally by circular Markov codes). We apply this to the loop counting method for determining the topological entropy of a subshift of finite type, to the zeta function of a Dyck shift over 2N symbols, and to the zeta function of a subshift of finite type which is obtained from a full shift by deleting one block of arbitrary length.
Reviewer: Gerhard Keller

MSC:

94B15 Cyclic codes
54H20 Topological dynamics (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berstel, J.; Perrin, D., Theory of Codes (1985), Academic Press: Academic Press London · Zbl 1022.94506
[2] Blanchard, F.; Hansel, G., Systèmes codés, Theoret. Comput. Sci., 44, 17-49 (1986) · Zbl 0601.68056
[3] Denker, M.; Grillenberger, C.; Sigmund, K., Ergodic theory on compact spaces, (Lecture Notes in Mathematics, Vol. 527 (1976), Springer-Verlag: Springer-Verlag Berlin/Heidelberg/New York) · Zbl 0328.28008
[4] Guibas, L. J.; Odlyzko, A. M., Maximal prefix-synchronized codes, SIAM J. Appl. Math., 35, 401-418 (1978) · Zbl 0394.94024
[5] Krieger, W., On the uniqueness of the equilibrium state, Math. Systems Theory, 8, 97-104 (1974) · Zbl 0302.28011
[6] Peterson, K., Chains, entropy, coding, Ergodic Theory Dynamical Systems, 6, 415-448 (1986) · Zbl 0587.28018
[7] Stanley, R. P., (Enumerative Combinatorics, Vol. I (1986), Brooks-Cole: Brooks-Cole Monterey, CA) · Zbl 0608.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.