Finitary codes for biinfinite words
J. Devolder, E. Timmerman (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J. Devolder, E. Timmerman (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Nguyen Huong Lam (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code,...
Peter Leupold, Victor Mitrana (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
Duplication is the replacement of a factor within a word by . This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word's duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite...
M. Madonia, S. Salemi, T. Sportelli (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A. Restivo, S. Salemi, T. Sportelli (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Do Long Van, Bertrand Le Saëc, Igor Litovsky (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Nguyen Huong Lâm, Do Long Van (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Clelia De Felice (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes)....