--
Antonin Callard
(Université de Caen, GREYC)
summary: Consider a tileset, i.e. a finite set of colors along with some adjacency constraints between them.
It defines the set of colorings of the infinite grid that respects these adjacency constraints.
Such a coloring is called a tiling.
Given a tileset as input, a question naturally arises: does ...
