Finitary codes for biinfinite words
J. Devolder, E. Timmerman (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Note on decipherability of three-word codes.”
Finitary codes for biinfinite words
On a class of infinitary codes
Nguyen Huong Lâm, Do Long Van (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A hierarchy for circular codes
Giuseppe Pirillo (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We first prove an extremal property of the infinite Fibonacci word : the family of the palindromic prefixes {} of is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
On identifying codes in the King grid that are robust against edge deletions.
Honkala, Iiro, Laihonen, Tero (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Binary Gray codes with long bit runs.
Goddyn, Luis, Gvozdjak, Pavol (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On coding morphisms for zigzag codes
Do Long Van, Bertrand Le Saëc, Igor Litovsky (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On -submonoids and -codes
M. Madonia, S. Salemi, T. Sportelli (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a complete set of operations for factorizing codes
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)....