Codes, unambiguous automata and sofic systems

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 - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Year:
2006

Citing 10
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
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Theory of Codes

Theory of Codes
Computing forbidden words of regular languages

Fundamenta Informaticae - Special issue on computing patterns in strings
Unique decipherability of codes with constraints with application to syllabification of Turkish words

COLING '73 Proceedings of the 5th conference on Computational linguistics - Volume 1
Codes and sofic constraints

Theoretical Computer Science - The art of theory
Complete codes in a sofic shift

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

Completing codes in a sofic shift

Theoretical Computer Science
Coding partitions: regularity, maximality and global ambiguity

DLT'07 Proceedings of the 11th international conference on Developments in language theory
An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the relationship between codes and unambiguous automata inside a sofic system. We show that a recognizable set is a code in a sofic system if and only if a particular automaton associated to the set and the shift is unambiguous. We discuss an example of a finite complete code in a sofic system in connection with the factorization conjecture.