Periodicity in tilings

Authors:
Emmanuel Jeandel;Pascal Vanier
Affiliations:
Laboratoire d'Informatique Fondamentale, Aix-Marseille Université, CNRS, Marseille, France;Laboratoire d'Informatique Fondamentale, Aix-Marseille Université, CNRS, Marseille, France
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 8
Cited 1

Nondeterministic space is closed under complementation

SIAM Journal on Computing
Structural complexity 2

Structural complexity 2
The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Turing machines and the spectra of first-order formulas with equality

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The Halting Probability via Wang Tiles

Fundamenta Informaticae
Formal language characterizations of P, NP, and Pspace

Journal of Automata, Languages and Combinatorics

Note: The periodic domino problem revisited

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.