DOIAbstract
AbstractIn this paper we give a new undecidability result about tiling problems. Given a finite set of polyomino types, the problem whether this set is a code, is undecidable. The same result holds for dominoes
AbstractIn this paper we give a new undecidability result about tiling problems. Given a finite set of polyomino types, the problem whether this set is a code, is undecidable. The same result holds for dominoes
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractIn this paper we present an extensive treatment of tile connectability problems, sometimes c...
AbstractIt is shown that the (infinite) tiling problem by Wang tiles is undecidable even if the give...
AbstractIn this paper we give a new undecidability result about tiling problems. Given a finite set ...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
AbstractIt is shown that the (infinite) tiling problem by Wang tiles is undecidable even if the give...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of ...
AbstractWhen can a given finite region consisting of cells in a regular lattice (triangular, square,...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractIn this paper we present an extensive treatment of tile connectability problems, sometimes c...
AbstractIt is shown that the (infinite) tiling problem by Wang tiles is undecidable even if the give...
AbstractIn this paper we give a new undecidability result about tiling problems. Given a finite set ...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
AbstractIt is shown that the (infinite) tiling problem by Wang tiles is undecidable even if the give...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of ...
AbstractWhen can a given finite region consisting of cells in a regular lattice (triangular, square,...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractIn this paper we present an extensive treatment of tile connectability problems, sometimes c...
AbstractIt is shown that the (infinite) tiling problem by Wang tiles is undecidable even if the give...
Add to ORKG