Abstract : We define a code in a sofic shift as a set of blocks of symbols of the shift such that any block of the shift has at most one decomposition in code words. It is maximal if it is not strictly included in another one. Such a code is complete in the sofic shift if any block of the shift occurs within some concatenation of code words. We prove that a maximal code in an irreducible sofic shift is complete in this shift. We give an explicit construction of a regular completion of a regular code in a sofic shift. This extends the well known result of Ehrenfeucht and Rozenberg to the case of codes in sofic systems. We also give a combinatorial proof of a result concerning the polynomial of a code in a sofic shift.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619856
Contributor : Marie-Pierre Béal
<>
Submitted on : Thursday, October 6, 2011 - 1:32:55 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM
Long-term archiving on: Saturday, January 7, 2012 - 2:21:34 AM
Marie-Pierre Béal, Dominique Perrin. Complete codes in a sofic shift. 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), 2002, France. pp.547-558. ⟨hal-00619856⟩
