Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2017

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties

Abstract

A two-dimensional code is defined as a set of rectangular pictures over an alphabet $\varSigma $ such that any picture over $\varSigma $ is tilable in at most one way with pictures in X. It is in general undecidable whether a set of pictures is a code, even in the finite case. Recently, finite strong prefix codes were introduced in [3] as a family of decidable picture codes. In this paper we study infinite strong prefix codes and give a characterization for the maximal ones based on iterated extensions. Moreover, we prove some properties regarding the measure of these codes.
Fichier principal
Vignette du fichier
447449_1_En_2_Chapter.pdf (294.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01656353 , version 1 (05-12-2017)

Licence

Attribution

Identifiers

Cite

Marcella Anselmo, Dora Giammarresi, Maria Madonia. Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.19-31, ⟨10.1007/978-3-319-58631-1_2⟩. ⟨hal-01656353⟩
143 View
120 Download

Altmetric

Share

Gmail Facebook X LinkedIn More