A two-dimensional code is defined as a set X ⊆ Σ <sup>∗∗</sup> such that any picture over Σ is tilable in at most one way with pictures in X. It is in general undecidable whether a set X of pictures is a code also in the finite case. Very recently in [3] strong prefix picture codes were defined as a decidable subclass that generalizes prefix string codes. Here a characterization for strong prefix codes that results in an effective procedure to construct them is presented. As a consequence there are also proved interesting results on the measure of strong prefix codes and a connection with the family of string prefix codes.
Anselmo, M., Giammarresi, D., Madonia, M. (2015). Structure and measure of a decidable class of two-dimensional codes. ??????? it.cilea.surplus.oa.citation.tipologie.CitationProceedings.prensentedAt ??????? 9th International Conference on Language and Automata Theory and Applications, LATA 2015, fra [10.1007/978-3-319-15579-1_24].
Structure and measure of a decidable class of two-dimensional codes
Giammarresi, Dora
;
2015-01-01
Abstract
A two-dimensional code is defined as a set X ⊆ Σ ∗∗ such that any picture over Σ is tilable in at most one way with pictures in X. It is in general undecidable whether a set X of pictures is a code also in the finite case. Very recently in [3] strong prefix picture codes were defined as a decidable subclass that generalizes prefix string codes. Here a characterization for strong prefix codes that results in an effective procedure to construct them is presented. As a consequence there are also proved interesting results on the measure of strong prefix codes and a connection with the family of string prefix codes.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.