@InProceedings{kari:LIPIcs.MFCS.2024.3,
  author =	{Kari, Jarkko},
  title =	{{On Low Complexity Colorings of Grids}},
  booktitle =	{49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)},
  pages =	{3:1--3:2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-335-5},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{306},
  editor =	{Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.3},
  URN =		{urn:nbn:de:0030-drops-205590},
  doi =		{10.4230/LIPIcs.MFCS.2024.3},
  annote =	{Keywords: symbolic dynamics, Nivat’s conjecture, Periodic tiling problem, periodicity, low pattern complexity, annihilator}
}