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.

DOI: 10.1016/j.tcs.2005.03.033

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Bal2005CodesAS, title={Codes and sofic constraints}, author={Marie-Pierre B{\'e}al and Dominique Perrin}, journal={Theor. Comput. Sci.}, year={2005}, volume={340}, pages={381-393} }