A set X of rectangular pictures over an alphabet A is a two-dimensional code if any picture over A is tilable in at most one way with pictures in X. Finite strong prefix codes were introduced in [1] as a family of decidable two- dimensional codes. We consider infinite strong prefix codes and give a char- acterization for the maximal ones based on the iterated extensions. Moreover, we study some properties related to the measure of these codes of pictures and prove some connections with the codes of strings.
Characterization and Measure of Infinite Two-dimensional Strong Prefix Codes
ANSELMO, Marcella;
2020-01-01
Abstract
A set X of rectangular pictures over an alphabet A is a two-dimensional code if any picture over A is tilable in at most one way with pictures in X. Finite strong prefix codes were introduced in [1] as a family of decidable two- dimensional codes. We consider infinite strong prefix codes and give a char- acterization for the maximal ones based on the iterated extensions. Moreover, we study some properties related to the measure of these codes of pictures and prove some connections with the codes of strings.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
