Completing codes
A. Restivo, S. Salemi, T. Sportelli (1989)
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:
M. Madonia, S. Salemi, T. Sportelli (1991)
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, Antonio Restivo (1985)
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:
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)....
Ludwig Staiger (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Yannick Guesnet (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.