文章基本信息
- 标题：Fixed Parameter Undecidability for Wang Tilesets
- 本地全文：下载
- 作者：Emmanuel Jeandel ; Nicolas Rolin
- 期刊名称：Electronic Proceedings in Theoretical Computer Science
- 电子版ISSN：2075-2180
- 出版年度：2012
- 卷号：90
- 页码：69-85
- DOI：10.4204/EPTCS.90.6
- 出版社：Open Publishing Association
- 摘要：Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the tiling problem remains undecidable if the difference between the number of tiles and the number of colors is bounded by 43.
One of the main new tool is the concept of Wang bars, which are equivalently inflated Wang tiles or thin polyominoes.
