Periodicity in tilings

Emmanuel Jeandel; Pascal Vanier

HAL: hal-00419196, version 1

DOI: 10.1007/978-3-642-14455-4_23

Short view

Export this paper

Periodicity in tilings
Jeandel E., Vanier P.
Developments in Language Theory 6224/2010 (2010) 243-254 - http://hal.archives-ouvertes.fr/hal-00419196

Publication type:

Article in peer-reviewed journal

Subject:

Computer Science/Discrete Mathematics

Title:

Periodicity in tilings

Author(s):

Emmanuel Jeandel (

) ¹, Pascal Vanier (

) ¹

Laboratory:

1:	Laboratoire d'informatique Fondamentale de Marseille (LIF)

	http://www.lif.univ-mrs.fr/

	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I

	CMI 39, Rue Joliot Curie 13453 MARSEILLE CEDEX 13

	France

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 characterize the sets of periods that a tiling system can produce. We prove that up to a slight recoding, they correspond exactly to languages in the complexity classes $\nspace{n}$ and $\cne$.

Fulltext language:

English

Journal:

Developments in Language Theory

Audience:

international

Publication date:

2010-08-20

Volume:

6224/2010

Page, identifiant, ...:

243-254

Attached file list to this document:

TEX

hal.bbl

(2.9 KB)

hal.blg

(995 B)

hal.tex

(31.3 KB)

figures

apres_compoA.tex

(1.7 KB)

apres_compoD.tex

(2.1 KB)

E-deter.tex

(402 B)

exemple_interdits.tex

(335 B)

(1 KB)

(1.1 KB)

(540 B)

(2.1 KB)

(368 B)

mt_nspacen_backup.tex

(1.5 KB)

(2.1 KB)

(3 KB)

(1010 B)

(2.3 KB)

(353 B)

(5.6 KB)

PDF

hal.pdf

(192 KB)

hal.ps

(334.3 KB)


hal-00419196, version 1
http://hal.archives-ouvertes.fr/hal-00419196
oai:hal.archives-ouvertes.fr:hal-00419196
From: Pascal Vanier <>
Submitted on: Tuesday, 22 September 2009 17:33:44
Updated on: Tuesday, 10 May 2011 09:49:00