arXiv:0909.3997v1 [cs.DM] 22 Sep 2009 rbeso oecasso oia omls ogl paig ea d we study speaking, to Roughly 60s the formulas. (a in logical constraints [16] local of Wang some classes by some introduced on was problems tilings of model The Introduction e fprosi uha nain.Oeohrwl nw xml sth is example known well other co One invariant. under an preserved such are is periods that of quantities set i.e. invariants, conjugacy tilings. with article obtain this syst can in tiling we result tiling a periods main a of of Our build existence sets periodic. to the the being imp of routine states them first characterization also [4] of The tilings is none tiling. tilings, of It periodic admits theory no period. hence the tiling, other on no any result is of there which tiling for no system but 1 period eproi fperiod of periodic be symb of question 13 a [14, to point-of-view. answer dynamics computational an symbolic a are of via obtained we analog results two-dimensional the a sense, as and [4] model itneof distance hc samaueo h rwho h ubrof number the of growth the of measure a is which n ftemi upsso utdmninlsmoi yaisi ode more to or, tilings is two same dynamics the the symbolic rougly if generate multidimensional systems of tiling two purposes whether main the of One htrsetteecntans(a constraints these respect that nieatiling. a inside hsmdlhsbe icvrdt eqieitrsigbt sacom a as both interesting quite be to discovered been has model This eid ntlnsaefnaetli h otx fsmoi dynamics symbolic of context the in fundamental are tilings in Periods nti ae econsider we paper this In rv htu oasih eoig hycrepn xcl t pro exactly can correspond system pape they classes tiling recoding, this complexity slight a In the a in that to system. periods dynamical that of prove a sets as the and characterize model computational a systems. Keywords: iig n iigssesaea btatcnetta aris that concept abstract an are systems tiling and Tilings subshifts ti ayt ul iigsse ota hr xssatln of tiling a exists there that so system tiling a build to easy is It . maulJadlPsa Vanier Pascal Jeandel Emmanuel opttoa n tutrlcmlxt,tlns dynami tilings, complexity, structural and Computational p hygnrt ojgtd n ftemi ol is tools main the of One conjugated. are generate they fi sivratb rnlto ya(horizontal/vertical) a by translation a by invariant is it if eidct ntilings in Periodicity iigsystem tiling oebr1,2018 13, November periods NSPACE tiling Abstract ftlns ooigo h ln ssi to said is plane the of coloring A tilings. of ). ,adw osdrclrnso h plane the of colorings consider we and ), 1 ( n and ) NE n . × n qae htcnappears can that squares languages o ue We duce. ohas both e jgc.The njugacy. lcdynamics olic accurately, ,we r, mwhich em e putation cal egiven entropy .I a In ]. ortant ecison [14]. cide sa is It turns out that a characterization of entropy in tilings, itself a combina- torial quantity, is intimately linked with computational theory, more precisely recursivity: entropy of tilings are exactly the (non-negative) right recursively enumerable numbers [9]. This is merely an exception: most conjugacy invariants are to be expressed in terms of recursivity theory [1, 15]. We prove a similar theorem for periods in tilings, answering a open problem in [15]. For periodic tilings, which are truly finite objects, the good analog will not be recursivity but rather complexity. We will see indeed in this article that sets of tilings correspond to complexity classes, in particular to non-deterministic exponential space and non-deterministic exponential time. These classes are not unusual for a specialist in descriptive complexity [8]. This is not a coincidence; the reader familiar with this topic may indeed see the results in this article as an analog for tilings of the classical result of Jones and Selman [11] on spectra of first order formulas.

1 Tilings, periodicity and computations