Abstract
Bricks are polyominoes with labelled cells. The problem of whether a given set of bricks is a code is undecidable in general. It is open for two-element sets. Here we consider sets consisting of square bricks only. We show that in this setting, the codicity of small sets (two bricks) is decidable, but 15 bricks are enough to make the problem undecidable. Thus the frontier between decidability and undecidability lies somewhere between these two numbers. Additionally we know that the codicity problem is decidable for sets with keys of size n when n = 1 and, under obvious constraints, for every n. We prove that it is undecidable in the general case of sets with keys of size n when n≥ 6.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoret. Comp. Sci. 147, 165–180 (1995)
Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoret. Comp. Sci. 303, 417–430 (2003)
Karhumäki, J.: Some open problems in combinatorics of words and related areas. TUCS Technical Report, vol. 359 (2000)
Margenstern, M.: Frontiers between decidability and undecidability: a survey. Theoret. Comp. Sci. 231, 217–251 (2000)
Matiyasevich, Y.: Simple examples of undecidable associative calculi. Soviet Math. Dokladi 8, 555–557 (1967)
Matiyasevich, Y.: Word problem for Thue systems with a few relations. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol. 909, pp. 39–53. Springer, Heidelberg (1995)
Matiyasevich, Y., Sénizergues, G.: Decision problems for semi-Thue systems with a few rules. In: Proceedings LICS 1996, pp. 523–531 (1996)
Moczurad, W.: Algebraic and algorithmic properties of brick codes. Doctoral thesis, Jagiellonian University (1999)
Moczurad, W.: Brick codes: families, properties, relations. Intern. J. Comp. Math. 74, 133–150 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moczurad, M., Moczurad, W. (2004). Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive