Periodicity in tilings

Emmanuel Jeandel, Pascal Vanier

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we prove an analog of the theorems of Fagin [9] and Selman and Jones [14] by characterizing sets of periods of tiling systems by complexity classes.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 14th International Conference, DLT 2010, Proceedings
Pages243-254
Number of pages12
DOIs
Publication statusPublished - 4 Nov 2010
Externally publishedYes
Event14th International Conference on Developments in Language Theory, DLT 2010 - London, ON, Canada
Duration: 17 Aug 201020 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6224 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Developments in Language Theory, DLT 2010
Country/TerritoryCanada
CityLondon, ON
Period17/08/1020/08/10

Keywords

  • Computational and structural complexity
  • Dynamical systems
  • Tilings

Fingerprint

Dive into the research topics of 'Periodicity in tilings'. Together they form a unique fingerprint.

Cite this