International audienceMichael Hochman showed that every 1D effectively closed subshift can be simulated by a 3D subshift of finite type and asked whether the same can be done in 2D. It turned out that the answer is positive and necessary tools were already developed in tilings theory. We discuss two alternative approaches: first, developed by N. Aubrun and M. Sablik, goes back to Leonid Levin; the second one, developed by the authors, goes back to Peter Gacs
International audienceIn this paper we study the directions of periodicity of multidimen-sional subs...
International audienceWe generalize the classical definition of effectively closed subshift to finit...
AbstractA new type of two-dimensional automaton has been defined to recognize a class of two-dimensi...
International audienceIn this article we study how a subshift can simulate another one, where the no...
We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw li...
International audienceWe study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that ...
International audienceTraditionally a tiling is defined with a finite number of finite forbidden patter...
International audienceSubshifts of finite type are sets of colorings of the plane defined by local c...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patt...
International audienceSubshifts of finite type are sets of colorings of the plane defined by local c...
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesti...
Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. I...
International audienceWe define 2-dimensional topological substitutions. A tiling of the Euclidean p...
International audienceWe study the projective subdynamics of two-dimensional shifts of finite type, ...
International audienceIn this paper we study the directions of periodicity of multidimen-sional subs...
International audienceWe generalize the classical definition of effectively closed subshift to finit...
AbstractA new type of two-dimensional automaton has been defined to recognize a class of two-dimensi...
International audienceIn this article we study how a subshift can simulate another one, where the no...
We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw li...
International audienceWe study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that ...
International audienceTraditionally a tiling is defined with a finite number of finite forbidden patter...
International audienceSubshifts of finite type are sets of colorings of the plane defined by local c...
International audienceThe classical Domino problem asks whether there exists a tiling in which none ...
Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patt...
International audienceSubshifts of finite type are sets of colorings of the plane defined by local c...
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesti...
Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. I...
International audienceWe define 2-dimensional topological substitutions. A tiling of the Euclidean p...
International audienceWe study the projective subdynamics of two-dimensional shifts of finite type, ...
International audienceIn this paper we study the directions of periodicity of multidimen-sional subs...
International audienceWe generalize the classical definition of effectively closed subshift to finit...
AbstractA new type of two-dimensional automaton has been defined to recognize a class of two-dimensi...