Fixed Parameter Undecidability for Wang Tilesets

Emmanuel Jeandel 1 Nicolas Rolin
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Type de document :
Communication dans un congrès
Enrico Formenti. JAC - 3rd International Symposium Journées Automates Cellulaires - 2012, Sep 2012, Bastia, France. EPTCS, 90, pp.69-85, 2012, Electronic Proceedings in Theoretical Computer Science. 〈10.4204/EPTCS.90.6〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00739038
Contributeur : Emmanuel Jeandel <>
Soumis le : vendredi 5 octobre 2012 - 15:36:48
Dernière modification le : jeudi 24 mai 2018 - 15:59:23

Lien texte intégral

Identifiants

Collections

Citation

Emmanuel Jeandel, Nicolas Rolin. Fixed Parameter Undecidability for Wang Tilesets. Enrico Formenti. JAC - 3rd International Symposium Journées Automates Cellulaires - 2012, Sep 2012, Bastia, France. EPTCS, 90, pp.69-85, 2012, Electronic Proceedings in Theoretical Computer Science. 〈10.4204/EPTCS.90.6〉. 〈hal-00739038〉

Partager

Métriques

Consultations de la notice

54