Publications HAL

2023/02 – Hardness of monadic second-order formulae over succinct graphs

2022/09 – Intrinsic Simulations and Universality in Automata Networks

2022/07 Theoretical Computer Science – Cellular automata and bootstrap percolation

2022/05 Natural Computing – Cold Dynamics in Cellular Automata: a Tutorial

2022/05 – On Turedo Hierarchies and Intrinsic Universality

2022/04 – The Mirage of Universality in Cellular Automata

2022/03 – Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)

2022/01 Discrete Mathematics and Theoretical Computer Science – Freezing, Bounded-Change and Convergent Cellular Automata

2021/12 – The Mirage of Universality in Cellular Automata

2021/07 – On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics

2021/05 – On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks

2021/03 – Rice-Like Theorems for Automata Networks

2021/02 – On the impact of treewidth in the computational complexity of freezing dynamics

2020/12 Theoretical Computer Science – Expansive automata networks

2020/08 – Commutative automata networks

2020/06 – On Simulation in Automata Networks

2020/05 Theoretical Computer Science – Pre-expansivity in cellular automata

2019/10 Theoretical Computer Science – Pre-Expansivity in Cellular Automata

2018/09 Ergodic Theory and Dynamical Systems – Characterizing Asymptotic Randomization in Abelian Cellular Automata

2018/07 – Universality in Freezing Cellular Automata

2018/02 Journal of Computer and System Sciences – On the complexity of two-dimensional signed majority cellular automata

2017/04 – On the cost of simulating a parallel Boolean automata network with a block-sequential one

2017/01 – Pavages et automates cellulaires

2016/06 – Propagation, Diffusion and Randomization in Cellular Automata

2015/06 – Introducing Freezing Cellular Automata

2015/01 Journal of Computer and System Sciences – μ-Limit Sets of Cellular Automata from a Computational Complexity Perspective

2014/01 – Intrinsic universality in tile self-assembly requires cooperation

2014/01 Information Processing Letters – Strict Majority Bootstrap Percolation in the r-wheel

2013/04 – Stochastic Cellular Automata: Correlations, Decidability and Simulations

2013/01 Fundamenta Informaticae – Stochastic Cellular Automata: Correlations, Decidability and Simulations

2013/01 Information and Computation – Subshifts as models for MSO logic

2012/05 – Asymptotically almost all $\lambda$-terms are strongly normalizing

2012/01 – Intrinsic Simulations between Stochastic Cellular Automata

2011/07 – Selfsimilarity, Simulation and Spacetime Symmetries

2011/01 Theoretical Computer Science – Bulking II: Classifications of cellular automata

2011/01 Discrete Mathematics and Theoretical Computer Science – Selfsimilarity, Simulation and Spacetime Symmetries

2011/01 Theoretical Computer Science – Bulking I: an Abstract Theory of Bulking

2011/01 Theoretical Computer Science – Directional Dynamics along Arbitrary Curves in Cellular Automata

2010/12 – Clandestine Simulations in Cellular Automata

2010/09 – Bulking I: an Abstract Theory of Bulking

2010/09 – Clandestine Simulations in Cellular Automata

2010/04 – On Factor Universality in Symbolic Spaces

2010/01 – Bulking II: Classifications of Cellular Automata

2009/12 – Subshifts as Models for MSO Logic

2009/06 – Subshifts, Languages and Logic

2009/05 – Communication Complexity and Intrinsic Universality in Cellular Automata

2009/02 – On Local Symmetries and Universality in Cellular Automata

2009/01 Theory of Computing Systems – Topological Dynamics of Cellular Automata: Dimension Matters

2008/06 – Topological Dynamics of 2D Cellular Automata

2008/04 – Amalgamation of cellular automata

2006/08 – On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures

2005/12 – Automates cellulaires : un modèle de complexités

2005/02 – How common can be universality in cellular automata?