The Dynamics of Cellular Automata in Shift-Invariant Topologies. - Laurent Bienvenu; Mathieu Sablik (Developments in Language Theory, 2007)

Topological Dynamics of 2D Cellular Automata. - Mathieu Sablik; Guillaume Theyssier (CiE, 2008)

Two points of view to study the iterates of a random configuration by a cellular automaton. - Mathieu Sablik (JAC, 2008)

Positive circuits and d-dimensional spatial differentiation: Application to the formation of sense organs in Drosophila. - Anne Crumière; Mathieu Sablik (Biosyst., 2008)

Directional dynamics for cellular automata: A sensitivity to initial condition approach. - Mathieu Sablik (Theor. Comput. Sci., 2008)

An Order on Sets of Tilings Corresponding to an Order on Languages. - Nathalie Aubrun; Mathieu Sablik (STACS, 2009)

Construction of µ-limit Sets. - Laurent Boyer 001; Martin Delacourt; Mathieu Sablik (JAC, 2010)

Self-organization in Cellular Automata: A Particle-Based Approach. - Benjamin Hellouin de Menibus; Mathieu Sablik (Developments in Language Theory, 2011)

Multidimensional effective S-adic systems are sofic - Nathalie Aubrun; Mathieu Sablik (CoRR, 2011)

Topological Dynamics of Cellular Automata: Dimension Matters. - Mathieu Sablik; Guillaume Theyssier (Theory Comput. Syst., 2011)

Directional dynamics along arbitrary curves in cellular automata. - Martin Delacourt; Victor Poupet; Mathieu Sablik; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Entry times in automata with simple defect dynamics - Benjamin Hellouin de Menibus; Mathieu Sablik (AUTOMATA & JAC, 2012)

Local Rules for Computable Planar Tilings - Thomas Fernique; Mathieu Sablik (AUTOMATA & JAC, 2012)

μ-Limit sets of cellular automata from a computational complexity perspective. - Laurent Boyer 001; Martin Delacourt; Victor Poupet; Mathieu Sablik; Guillaume Theyssier (J. Comput. Syst. Sci., 2015)

The Domino Problem for Self-similar Structures. - Sebastián Barbieri; Mathieu Sablik (CiE, 2016)

Effective S-adic Symbolic Dynamical Systems. - Valérie Berthé; Thomas Fernique; Mathieu Sablik (CiE, 2016)

Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic. - Mathieu Sablik; Michael Schraudner (ICALP, 2016)

Row-constrained effective sets of colourings in the $2$-fold horocyclic tessellations of $ mathbb{H}^2$ are sofic. - Nathalie Aubrun; Mathieu Sablik (CoRR, 2016)

Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type. - Nathalie Aubrun; Mathieu Sablik (CoRR, 2016)

Weak colored local rules for planar tilings. - Thomas Fernique; Mathieu Sablik (CoRR, 2016)

Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. - Benjamin Hellouin de Menibus; Mathieu Sablik (CoRR, 2016)

Block gluing intensity of bidimensional SFT: computability of the entropy and periodic points. - Silvère Gangloff; Mathieu Sablik (CoRR, 2017)

Ergodicity of some classes of cellular automata subject to noise. - Irène Marcovici; Mathieu Sablik; Siamak Taati (CoRR, 2017)

A notion of effectiveness for subshifts on finitely generated groups. - Nathalie Aubrun; Sebastián Barbieri; Mathieu Sablik (Theor. Comput. Sci., 2017)

On the computability properties of topological entropy: a general approach. - Silvère Gangloff; Alonso Herrera; Cristobal Rojas; Mathieu Sablik (CoRR, 2019)

Domino Problem Under Horizontal Constraints. - Nathalie Aubrun; Julien Esnay; Mathieu Sablik (STACS, 2020)

On entropies of block-gluing subshifts. - Svetlana Puzynina; Mathieu Sablik (CoRR, 2020)

Characterisation of the Set of Ground States of Uniformly Chaotic Finite-Range Lattice Models. - Léo Gayral; Mathieu Sablik; Siamak Taati (CoRR, 2023)

On the algorithmic descriptive complexity of attractors in topological dynamics. - Cristobal Rojas; Mathieu Sablik (CoRR, 2023)

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. - Léo Gayral; Mathieu Sablik (Theory Comput. Syst., 2023)

Characterization of the set of zero-noise limits measures of perturbed cellular automata. - Hugo Marsan; Mathieu Sablik (CoRR, 2024)