| Publication | Date of Publication | Type |
|---|
| Finding codes on infinite grids automatically | 2024-10-07 | Paper |
| What can oracles teach us about the ultimate fate of life? | 2024-06-24 | Paper |
| Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents | 2024-03-26 | Paper |
| Sequentializing cellular automata | 2024-02-09 | Paper |
| Independent finite automata on Cayley graphs | 2024-02-09 | Paper |
| Soficity of free extensions of effective subshifts | 2023-09-05 | Paper |
| Diddy: a Python toolbox for infinite discrete dynamical systems | 2023-05-02 | Paper |
| The group of reversible Turing machines: subgroups, generators and computability | 2023-03-30 | Paper |
| Finding codes on infinite grids automatically | 2023-03-01 | Paper |
| A physically universal Turing machine | 2023-01-09 | Paper |
| Gardens of Eden in the game of life | 2022-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089254 | 2022-07-18 | Paper |
| Cellular automata and bootstrap percolation | 2022-06-13 | Paper |
| Automatic winning shifts | 2022-06-08 | Paper |
| What can oracles teach us about the ultimate fate of life? | 2022-02-15 | Paper |
| On prefix palindromic length of automatic words | 2021-10-21 | Paper |
| Cellular Automata and Bootstrap Percolation | 2021-10-01 | Paper |
| Nilpotent endomorphisms of expansive group actions | 2021-06-18 | Paper |
| Topology inspired problems for cellular automata, and a counterexample in topology | 2021-04-27 | Paper |
| On derivatives and subpattern orders of countable subshifts | 2021-04-27 | Paper |
| Groups with self-simulable zero-dimensional dynamics | 2021-04-11 | Paper |
| Recoding Lie algebraic subshifts | 2021-02-23 | Paper |
| Avoiding abelian powers cyclically | 2021-02-02 | Paper |
| Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\) | 2021-02-02 | Paper |
| On prefix palindromic length of automatic words | 2020-09-07 | Paper |
| On \(k\)-abelian equivalence and generalized Lagrange spectra | 2020-07-16 | Paper |
| Abelian periods of factors of Sturmian words | 2020-06-02 | Paper |
| A Physically Universal Turing Machine | 2020-03-20 | Paper |
| Characterizing asymptotic randomization in abelian cellular automata | 2020-03-10 | Paper |
| More on the dynamics of the symbolic square root map | 2020-01-16 | Paper |
| Gardens of Eden in the Game of Life | 2019-12-02 | Paper |
| Every nonnegative real number is an abelian critical exponent | 2019-11-06 | Paper |
| On pointwise periodicity in tilings, cellular automata, and subshifts | 2019-08-20 | Paper |
| On winning shifts of marked uniform substitutions | 2019-07-18 | Paper |
| Automatic sequences based on Parry or Bertrand numeration systems | 2019-07-11 | Paper |
| Transitive action on finite points of a full shift and a finitary Ryan’s theorem | 2019-05-13 | Paper |
| Distributed testing of excluded subgraphs | 2018-08-16 | Paper |
| Sequentializing cellular automata | 2018-08-10 | Paper |
| A note on subgroups of automorphism groups of full shifts | 2018-05-24 | Paper |
| Strict asymptotic nilpotency in cellular automata | 2018-03-08 | Paper |
| Sequentializing cellular automata | 2018-02-19 | Paper |
| Finite generating sets for reversible gate sets under general conservation laws | 2017-12-06 | Paper |
| More on the dynamics of the symbolic square root map (extended abstract) | 2017-11-15 | Paper |
| Decidability and universality of quasiminimal subshifts | 2017-09-07 | Paper |
| A one-dimensional physically universal cellular automaton | 2017-08-04 | Paper |
| A square root map on Sturmian words | 2017-04-10 | Paper |
| Toeplitz subshift whose automorphism group is not finitely generated | 2016-11-18 | Paper |
| The group of reversible Turing machines | 2016-08-10 | Paper |
| Strongly universal reversible gate sets | 2016-08-10 | Paper |
| Remarks on privileged words | 2016-08-08 | Paper |
| Color blind cellular automata | 2016-06-10 | Paper |
| Abelian powers and repetitions in Sturmian words | 2016-05-26 | Paper |
| Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model | 2016-01-08 | Paper |
| PSPACE-completeness of majority automata networks | 2015-12-08 | Paper |
| A square root map on Sturmian words (extended abstract) | 2015-11-04 | Paper |
| Block maps between primitive uniform and Pisot substitutions | 2015-10-12 | Paper |
| Groups and Monoids of Cellular Automata | 2015-08-07 | Paper |
| Group-walking automata | 2015-08-07 | Paper |
| Complexity of conjugacy, factoring and embedding for countable sofic shifts of rank 2 | 2015-08-04 | Paper |
| Plane-walking automata | 2015-08-04 | Paper |
| Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes | 2015-07-24 | Paper |
| Characterization of repetitions in Sturmian words: a new proof | 2015-07-15 | Paper |
| Factor Colorings of Linearly Recurrent Words | 2015-04-22 | Paper |
| Category theory of symbolic dynamics | 2015-01-23 | Paper |
| Playing with subshifts | 2014-12-22 | Paper |
| Realization problems for nonuniform cellular automata | 2014-11-26 | Paper |
| Trace complexity of chaotic reversible cellular automata | 2014-09-02 | Paper |
| Constructions with countable subshifts of finite type | 2014-02-11 | Paper |
| Introducing privileged words: privileged complexity of Sturmian words | 2013-12-19 | Paper |
| Color blind cellular automata | 2013-10-10 | Paper |
| Commutators of bipermutive and affine cellular automata | 2013-10-10 | Paper |
| Geometry and dynamics of the Besicovitch and Weyl spaces | 2012-11-02 | Paper |
| Computational aspects of cellular automata on countable sofic shifts | 2012-09-25 | Paper |
| A characterization of cellular automata generated by idempotents on the full shift | 2012-09-10 | Paper |
| On shift spaces with algebraic structure | 2012-08-14 | Paper |
| On stable and unstable limit sets of finite families of cellular automata | 2012-06-08 | Paper |
| A survey on picture-walking automata | 2011-11-11 | Paper |
