Codes and sofic constraints
We study the notion of a code in a sofic subshift. We first give a generalization of the Kraft-McMillan inequality to this case. We then prove that the polynomial of the alphabet in an irreducible sofic shift divides the polynomial of any finite code which is complete for this sofic shift. This settles a conjecture from Reutenauer. (c) 2005 Elsevier B.V. All rights reserved.
kraft-mcmillan inequality sofic shifts symbolic dynamics variable-length codes