Keller G (1991)
Publication Type: Journal article, Original article
Publication year: 1991
Publisher: Elsevier
Book Volume: 56
Pages Range: 75--83
Journal Issue: 1
DOI: 10.1016/0097-3165(91)90023-A
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 the Dyck-shift over 2N symbols, and to the zeta-function of a subshift of finite ype which is obtained from a full shift by deleting one block of arbitrary length.
APA:
Keller, G. (1991). Circular codes, loop counting, and zeta-functions. Journal of Combinatorial Theory Series A, 56(1), 75--83. https://doi.org/10.1016/0097-3165(91)90023-A
MLA:
Keller, Gerhard. "Circular codes, loop counting, and zeta-functions." Journal of Combinatorial Theory Series A 56.1 (1991): 75--83.
BibTeX: Download