| Publication | Date of Publication | Type |
|---|
Short-range and long-range order: a transition in block-gluing behavior in Hom shifts
(available as arXiv preprint) | N/A | Paper |
String attractors and bi-infinite words
(available as arXiv preprint) | N/A | Paper |
Undecidability of the block gluing classes of homshifts
Nonlinearity | 2026-08-13 | Paper |
| Subshifts defined by nondeterministic and alternating plane-walking automata | 2026-06-24 | Paper |
Short-range and long-range order: a transition in block-gluing behavior in Hom shifts
Journal d'Analyse Mathématique | 2026-06-17 | Paper |
Decision problems on geometric tilings. Wang potatoes and finite local complexity
Theoretical Computer Science | 2026-02-27 | Paper |
| Symbol frequencies in surjective cellular automata | 2026-02-10 | Paper |
| Two-player domino games | 2025-02-07 | Paper |
The domino problem is undecidable on every rhombus subshift
Developments in Language Theory | 2023-11-16 | Paper |
Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton
The Annals of Applied Probability | 2021-11-04 | Paper |
Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton
The Annals of Applied Probability | 2021-11-04 | Paper |
Nontrivial turmites are Turing-universal
(available as arXiv preprint) | 2021-08-24 | Paper |
| Nontrivial turmites are Turing-universal | 2021-08-24 | Paper |
Aperiodic points in \(\mathbb{Z}^2\)-subshifts
(available as arXiv preprint) | 2021-07-28 | Paper |
Entry times in automata with simple defect dynamics
(available as arXiv preprint) | 2021-04-27 | Paper |
| Entry times in automata with simple defect dynamics | 2021-04-27 | Paper |
Necessary conditions for tiling finitely generated amenable groups
Discrete and Continuous Dynamical Systems | 2020-04-16 | Paper |
Characterizing asymptotic randomization in abelian cellular automata
Ergodic Theory and Dynamical Systems | 2020-03-10 | Paper |
Effect of quantified irreducibility on the computability of subshift entropy
Discrete and Continuous Dynamical Systems | 2019-03-26 | Paper |
Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
Ergodic Theory and Dynamical Systems | 2018-05-24 | Paper |
Characterisation of limit measures of higher-dimensional cellular automata
Theory of Computing Systems | 2018-02-01 | Paper |
Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
Journal of Statistical Physics | 2017-10-16 | Paper |
| Construction of -limit sets of two-dimensional cellular automata | 2017-01-24 | Paper |
Self-organization in cellular automata: a particle-based approach
Developments in Language Theory | 2011-07-29 | Paper |
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
Lecture Notes in Computer Science | 2011-07-01 | Paper |
