Codes and sofic constraints

Authors:
Marie-Pierre Béal;Dominique Perrin
Affiliations:
Institut Gaspard-Monge, Université de Marne-la-Vallée, Marne-la-Vallée Cedex, France;Institut Gaspard-Monge, Université de Marne-la-Vallée, Marne-la-Vallée Cedex, France
Venue:
Theoretical Computer Science - The art of theory
Year:
2005

Citing 5
Cited 4

Rational series and their languages

Rational series and their languages
Finite biprefix sets of paths in a graph

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
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

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

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.