A codicity undecidable problem in the plane.
type: Item
instance of: scholarly article
title: A codicity undecidable problem in the plane.
zbMATH Open document ID: 1053.68067
DOI: 10.1016/S0304-3975(03)00029-X
author: Danièle Beauquier
author: M. Nivat
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 52C20
zbMATH DE Number: 1965381
zbMATH Keywords: Polyomino
zbMATH Keywords: Tiling
zbMATH Keywords: Undecidability
zbMATH Keywords: Code
zbMATH Keywords: Domino tiling
MaRDI profile type: Publication
cites work: An undecidable problem about rational sets and contour words of polyominoes
cites work: The undecidability of the domino problem
cites work: Q4198056
cites work: Tiling with sets of polyominoes
cites work: Q3735714
cites work: Recurring Dominoes: Making the Highly Undecidable Highly Understandable
cites work: Notes on a class of tiling problems
full work available at URL: s0304-3975(03)00029-x
OpenAlex ID: W2064947749
Recommended article: Undecidability of the theory of projective planes
Recommended article: An undecidable problem in correspondence theory
Recommended article: Q3772198
Recommended article: An undecidable problem in finite combinatorics
Recommended article: Q3989925
Recommended article: Undecidability in Weihrauch Degrees
Recommended article: A decidable variety that is finitely undecidable
Recommended article: Q4378254
Recommended article: Q4492883
Recommended article: Undecidability in Some Structures Related to Computation Theory
description: scientific article; zbMATH DE number 1965381