Codes asynchrones
Codes avec des mots infinis
Codes générateurs minimaux de langages de mots bi-infinis
Codes générateurs minimaux de langages de mots bi-infinis
In this paper we give two families of codes which are minimal generators of biinfinite languages: the family of very thin codes (which contains the rational codes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.
Coding in the existential theory of concatenation.
Compatibility relations on codes and free monoids
A compatibility relation on letters induces a reflexive and symmetric relation on words of equal length. We consider these word relations with respect to the theory of variable length codes and free monoids. We define an (R,S)-code and an (R,S)-free monoid for arbitrary word relations R and S. Modified Sardinas-Patterson algorithm is presented for testing whether finite sets of words are (R,S)-codes. Coding capabilities of relational codes are measured algorithmically by finding minimal and maximal relations....
Construction de codes indécomposables