Fixed Parameter Undecidability for Wang Tilesets - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Fixed Parameter Undecidability for Wang Tilesets

(1) ,
1
Nicolas Rolin
  • Function : Author

Abstract

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.

Dates and versions

hal-00739038 , version 1 (05-10-2012)

Identifiers

Cite

Emmanuel Jeandel, Nicolas Rolin. Fixed Parameter Undecidability for Wang Tilesets. JAC - 3rd International Symposium Journées Automates Cellulaires - 2012, Enrico Formenti, Sep 2012, Bastia, France. pp.69-85, ⟨10.4204/EPTCS.90.6⟩. ⟨hal-00739038⟩
74 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More