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

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

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

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

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

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

Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

Picture codes

Symeon BozapalidisArchontia Grammatikopoulou — 2006

RAIRO - Theoretical Informatics and Applications

We introduce doubly-ranked (DR) monoids in order to study picture codes. We show that a DR-monoid is free iff it is pictorially stable. This allows us to associate with a set of pictures a picture code which is the basis of the least DR-monoid including . A weak version of the defect theorem for pictures is established. A characterization of picture codes through picture series is also given.

Polypodic codes

Symeon BozapalidisOlympia Louscou-Bozapalidou — 2002

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

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Polypodic codes

Symeon BozapalidisOlympia Louscou–Bozapalidou — 2010

RAIRO - Theoretical Informatics and Applications

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Page 1

Download Results (CSV)