Complete codes in a sofic shift

Authors:
Marie-Pierre Béal;Dominique Perrin
Affiliations:
Institut Gaspard-Monge, University of Marne-la-Vallée, France;Institut Gaspard-Monge, University of Marne-la-Vallée, France
Venue:
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Year:
2006

Citing 6
Cited 3

Rational series and their languages

Rational series and their languages
Codes and local constraints

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

Theory of Codes
Codes and sofic constraints

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
Completing codes in a sofic shift

Theoretical Computer Science
Codes and maximal monoids

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.