Infinite snake tiling problems

MaRDI QIDQ4412100zbMATH OpenFDO

Authors Jarkko Kari

Publication date 13 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2450/24500067.htm

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Combinatorial aspects of tessellation and tiling problems (05B45) Cellular automata (computational aspects) (68Q80) Combinatorics in computer science (68R05)

Recommendations

• On the solvability of domino snake problems
• Snakes and cellular automata: reductions and inseparability results
• Fixed parameter undecidability for Wang tilesets
• Universal Tilings
• On the Undecidability of the Tiling Problem

Cited in

(11)

• Perfectly quilted rectangular snake tilings
• On the solvability of domino snake problems
• Nonemptiness problems of Wang tiles with three colors
• Snakes and cellular automata: reductions and inseparability results
• Universal Tilings
• scientific article; zbMATH DE number 2119689 (Why is no real title available?)
• Fixed parameter undecidability for Wang tilesets
• Wang tiles: connectivity when tiling a plane
• Wang tilings and distributed verification on anonymous torus networks
• The group of reversible Turing machines: subgroups, generators, and computability
• Algorithmic quipu representation of non-cooperative directed 2D tile assembly

This page was built for publication: Infinite snake tiling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412100)