Circular codes, loop counting, and zeta-functions

Gerhard Keller
1991 Journal of combinatorial theory. Series 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.
doi:10.1016/0097-3165(91)90023-a fatcat:ah65kiqwhve3njcch3j6obk33y