Rational series and their languages
Rational series and their languages
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Surjective extensions of sliding-block codes
SIAM Journal on Discrete Mathematics
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Theory of Codes
Theoretical Computer Science - The art of theory
Codes, unambiguous automata and sofic systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Complete codes in a sofic shift
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 5.23 |
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 into 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.