The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Picture codes”

Compatibility relations on codes and free monoids

Tomi Kärki (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

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 -code and an -free monoid for arbitrary word relations and . Modified Sardinas-Patterson algorithm is presented for testing whether finite sets of words are -codes. Coding capabilities of relational codes are measured algorithmically by finding minimal and maximal relations....

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:

Bi-infinitary codes

Do Long Van, D. G. Thomas, K. G. Subramanian, Rani Siromoney (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 z -submonoids and z -codes

M. Madonia, S. Salemi, T. Sportelli (1991)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: