default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Sablik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Léo Gayral, Mathieu Sablik:
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. Theory Comput. Syst. 67(6): 1209-1240 (2023)- [i18]Léo Gayral, Mathieu Sablik, Siamak Taati:
Characterisation of the Set of Ground States of Uniformly Chaotic Finite-Range Lattice Models. CoRR abs/2302.07326 (2023) - [i17]Cristobal Rojas, Mathieu Sablik:
On the algorithmic descriptive complexity of attractors in topological dynamics. CoRR abs/2311.15234 (2023) - 2022
- [i16]Léo Gayral, Mathieu Sablik:
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. CoRR abs/2209.01949 (2022) - 2020
- [c12]Nathalie Aubrun
, Julien Esnay, Mathieu Sablik:
Domino Problem Under Horizontal Constraints. STACS 2020: 26:1-26:15 - [i15]Svetlana Puzynina, Mathieu Sablik:
On entropies of block-gluing subshifts. CoRR abs/2012.09415 (2020)
2010 – 2019
- 2019
- [i14]Silvère Gangloff, Alonso Herrera, Cristobal Rojas, Mathieu Sablik:
On the computability properties of topological entropy: a general approach. CoRR abs/1906.01745 (2019) - 2017
- [j6]Nathalie Aubrun, Sebastián Barbieri, Mathieu Sablik:
A notion of effectiveness for subshifts on finitely generated groups. Theor. Comput. Sci. 661: 35-55 (2017) - [i13]Silvère Gangloff, Mathieu Sablik:
Block gluing intensity of bidimensional SFT: computability of the entropy and periodic points. CoRR abs/1706.01627 (2017) - [i12]Irène Marcovici, Mathieu Sablik, Siamak Taati:
Ergodicity of some classes of cellular automata subject to noise. CoRR abs/1712.05500 (2017) - 2016
- [c11]Valérie Berthé, Thomas Fernique, Mathieu Sablik:
Effective S-adic Symbolic Dynamical Systems. CiE 2016: 13-23 - [c10]Sebastián Barbieri, Mathieu Sablik:
The Domino Problem for Self-similar Structures. CiE 2016: 205-214 - [c9]Mathieu Sablik, Michael Schraudner:
Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic. ICALP 2016: 110:1-110:14 - [i11]Nathalie Aubrun, Mathieu Sablik:
Row-constrained effective sets of colourings in the $2$-fold horocyclic tessellations of $\mathbb{H}^2$ are sofic. CoRR abs/1602.04061 (2016) - [i10]Benjamin Hellouin de Menibus, Mathieu Sablik:
Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. CoRR abs/1602.06093 (2016) - [i9]Nathalie Aubrun, Mathieu Sablik:
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type. CoRR abs/1602.06095 (2016) - [i8]Thomas Fernique, Mathieu Sablik:
Weak colored local rules for planar tilings. CoRR abs/1603.09485 (2016) - 2015
- [j5]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit sets of cellular automata from a computational complexity perspective. J. Comput. Syst. Sci. 81(8): 1623-1647 (2015) - 2013
- [i7]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit Sets of Cellular Automata from a Computational Complexity Perspective. CoRR abs/1309.6730 (2013) - 2012
- [c8]Benjamin Hellouin de Menibus, Mathieu Sablik:
Entry times in automata with simple defect dynamics. AUTOMATA & JAC 2012: 97-109 - [c7]Thomas Fernique, Mathieu Sablik:
Local Rules for Computable Planar Tilings. AUTOMATA & JAC 2012: 133-141 - 2011
- [j4]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of Cellular Automata: Dimension Matters. Theory Comput. Syst. 48(3): 693-714 (2011) - [j3]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional dynamics along arbitrary curves in cellular automata. Theor. Comput. Sci. 412(30): 3800-3821 (2011) - [c6]Benjamin Hellouin de Menibus, Mathieu Sablik:
Self-organization in Cellular Automata: A Particle-Based Approach. Developments in Language Theory 2011: 251-263 - [i6]Nathalie Aubrun, Mathieu Sablik:
Multidimensional effective S-adic systems are sofic. CoRR abs/1103.0895 (2011) - 2010
- [c5]Laurent Boyer, Martin Delacourt, Mathieu Sablik:
Construction of µ-limit Sets. JAC 2010: 76-87 - [i5]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional Dynamics along Arbitrary Curves in Cellular Automata. CoRR abs/1001.5470 (2010) - [i4]Laurent Boyer, Martin Delacourt, Mathieu Sablik:
Construction of μ-Limit Sets. CoRR abs/1012.1333 (2010)
2000 – 2009
- 2009
- [c4]Nathalie Aubrun, Mathieu Sablik:
An Order on Sets of Tilings Corresponding to an Order on Languages. STACS 2009: 99-110 - [i3]Nathalie Aubrun, Mathieu Sablik:
An Order on Sets of Tilings Corresponding to an Order on Languages. CoRR abs/0902.1602 (2009) - 2008
- [j2]Anne Crumière, Mathieu Sablik:
Positive circuits and d-dimensional spatial differentiation: Application to the formation of sense organs in Drosophila. Biosyst. 94(1-2): 102-108 (2008) - [j1]Mathieu Sablik:
Directional dynamics for cellular automata: A sensitivity to initial condition approach. Theor. Comput. Sci. 400(1-3): 1-18 (2008) - [c3]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of 2D Cellular Automata. CiE 2008: 523-532 - [c2]Mathieu Sablik:
Two points of view to study the iterates of a random configuration by a cellular automaton. JAC 2008: 161-173 - [i2]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of Cellular Automata: Dimension Matters. CoRR abs/0811.2731 (2008) - 2007
- [c1]Laurent Bienvenu, Mathieu Sablik:
The Dynamics of Cellular Automata in Shift-Invariant Topologies. Developments in Language Theory 2007: 84-95 - [i1]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of 2D Cellular Automata. CoRR abs/0709.4565 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
