| The expressiveness of quasiperiodic and minimal shifts of finite type | 0 | 0.34 | 2018 |
| On the expressive power of quasiperiodic SFT. | 1 | 0.36 | 2017 |
| Discrete mathematical structures: From dynamics to complexity. | 0 | 0.34 | 2013 |
| Tilings robust to errors | 0 | 0.34 | 2010 |
| 1D Effectively Closed Subshifts and 2D Tilings | 0 | 0.34 | 2010 |
| Effective closed subshifts in 1D can be implemented in 2D | 9 | 1.23 | 2010 |
| First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), Uzès, France, April 21-25, 2008. Proceedings | 25 | 3.61 | 2009 |
| Fixed point theorem and aperiodic tilings | 2 | 0.60 | 2009 |
| Asymptotic Cellular Complexity | 0 | 0.34 | 2009 |
| High Complexity Tilings with Sparse Errors | 2 | 0.46 | 2009 |
| Fixed-point tile sets and their applications | 19 | 1.35 | 2009 |
| Fixed Point and Aperiodic Tilings | 12 | 1.05 | 2008 |
| Complex tilings | 7 | 0.85 | 2008 |
| Structural aspects of tilings | 10 | 1.09 | 2008 |
| STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings | 43 | 4.48 | 2006 |
| STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings | 48 | 4.38 | 2005 |
| A new dimension sensitive property for cellular automata | 7 | 0.75 | 2005 |
| Ecological Turing Machines | 0 | 0.34 | 2004 |
| Kolmogorov-Loveland stochasticity for finite strings | 5 | 0.62 | 2004 |
| Tilings: recursivity and regularity | 11 | 1.85 | 2004 |
| On undecidability of equicontinuity classification for cellular automata | 26 | 2.69 | 2003 |
| Do stronger definitions of randomness exist? | 0 | 0.34 | 2003 |
| Number-conserving cellular automata I | 29 | 2.27 | 2003 |
| Number conserving cellular automata: new results on decidability and dynamics | 8 | 0.72 | 2003 |
| De la logique aux pavages | 3 | 0.45 | 2002 |
| Kolmogorov Complexity - Foreword | 0 | 0.34 | 2002 |
| Complex tilings | 20 | 3.06 | 2001 |
| Algorithmic Information Theory and Cellular Automata Dynamics | 2 | 0.50 | 2001 |
| Descriptive complexity of computable sequences | 6 | 1.42 | 2001 |
| Deterministic Rational Transducers and Random Sequences | 1 | 0.42 | 1998 |
| Deterministic Rational Transducers and Random Sequences | 0 | 0.34 | 1998 |
| Tilings and Quasiperiodicity | 5 | 0.92 | 1997 |
| Self-Similarity Viewed as a Local Property via Tile Sets | 2 | 0.68 | 1996 |
| Growing Patterns in 1D Cellular Automata | 0 | 0.34 | 1995 |
| Growing Patterns in One Dimensional Cellular Automata. | 0 | 0.34 | 1994 |
| Global Properties of 2D Cellular Automata: Some Complexity Results | 4 | 0.50 | 1993 |
| Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof | 1 | 0.38 | 1993 |
