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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Béal, M. P., & Perrin, D. (2006). Complete codes in a sofic shift. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3884 LNCS, pp. 127–136). Springer Verlag. https://doi.org/10.1007/11672142_9
Mendeley helps you to discover research relevant for your work.