A codicity undecidable problem in the plane.
From MaRDI portal
Publication:1401375
DOI10.1016/S0304-3975(03)00029-XzbMATH Open1053.68067OpenAlexW2064947749MaRDI QIDQ1401375FDOQ1401375
Authors: Danièle Beauquier, M. Nivat 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00029-x
Recommendations
- Undecidability of the theory of projective planes
- An undecidable problem in correspondence theory
- scientific article; zbMATH DE number 4031659
- An undecidable problem in finite combinatorics
- scientific article; zbMATH DE number 35404
- Undecidability in Weihrauch degrees
- A decidable variety that is finitely undecidable
- scientific article; zbMATH DE number 1123898
- Publication:4492883
- Undecidability in Some Structures Related to Computation Theory
Combinatorics in computer science (68R05) Polyominoes (05B50) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tiling with sets of polyominoes
- The undecidability of the domino problem
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Notes on a class of tiling problems
- An undecidable problem about rational sets and contour words of polyominoes
Cited In (21)
- Unbordered pictures: properties and construction
- Prefix picture codes: a decidable class of two-dimensional codes
- Sets of pictures avoiding overlaps
- Two-dimensional codes
- The periodic domino problem revisited
- Full sets of pictures to encode pictures
- Defect theorem in the plane
- Directed figure codes: decidability frontier
- Picture codes
- Rectangular tileability and complementary tileability are undecidable
- The domino problem of the hyperbolic plane is undecidable
- Computing and Combinatorics
- How Many Figure Sets Are Codes?
- The code problem for directed figures
- Picture codes and deciphering delay
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Two-dimensional comma-free and cylindric codes
- Structure and properties of strong prefix codes of pictures
- Title not available (Why is that?)
- Characterization and measure of infinite two-dimensional strong prefix codes
- An undecidable problem about rational sets and contour words of polyominoes
This page was built for publication: A codicity undecidable problem in the plane.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401375)
