Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 3:42:13 PM
Last modification on : Monday, October 19, 2020 - 8:02:03 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads