| Publication | Date of Publication | Type |
|---|
On relations between properties in transitive Turing machines
Nonlinearity | 2023-11-01 | Paper |
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
Developments in Language Theory | 2023-06-30 | Paper |
Freezing, bounded-change and convergent cellular automata
Discrete Mathematics & Theoretical Computer Science | 2022-06-08 | Paper |
Intrinsically universal cellular automata
| 2021-01-20 | Paper |
A particular universal cellular automaton
| 2021-01-20 | Paper |
On the complexity of the stability problem of binary freezing totalistic cellular automata
Information and Computation | 2020-09-17 | Paper |
On aperiodic reversible Turing machines (invited talk)
| 2018-10-17 | Paper |
Universality in freezing cellular automata
| 2018-09-06 | Paper |
Universality in Freezing Cellular Automata
| 2018-04-20 | Paper |
On the computational complexity of the freezing non-strict majority automata
| 2018-03-08 | Paper |
Permutive one-way cellular automata and the finiteness problem for automaton groups
| 2017-08-04 | Paper |
A small minimal aperiodic reversible Turing machine
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Some undecidable problems about the trace-subshift associated to a Turing machine
| 2015-12-03 | Paper |
Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
Reversible Computation | 2015-11-30 | Paper |
The transitivity problem of Turing machines
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Knight tiles: particles and collisions in the realm of 4-way deterministic tilings
Developments in Language Theory | 2014-10-14 | Paper |
Substitutions and strongly deterministic tilesets
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Tutorial on cellular automata
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Four states are enough!
Theoretical Computer Science | 2011-01-10 | Paper |
Combinatorial substitutions and sofic tilings
| 2010-09-27 | Paper |
Automata on the plane vs particles and collisions
Theoretical Computer Science | 2009-07-10 | Paper |
Tiling the Plane with a Fixed Number of Polyominoes
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Periodicity and Immortality in Reversible Computing
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Playing with Conway's problem
Theoretical Computer Science | 2009-01-08 | Paper |
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
Logic and Theory of Algorithms | 2008-06-19 | Paper |
scientific article; zbMATH DE number 2086632 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1962850 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1839463 (Why is no real title available?)
| 2002-12-02 | Paper |
The commutation of finite sets: A challenging problem
Theoretical Computer Science | 2002-07-15 | Paper |
