We study an abstract group of reversible Turing machines. In our model, ...
Many decision problems concerning cellular automata are known to be deci...
A d-dimensional configuration c : Z^d -> A is a coloring of the d-dimens...
We present Planar Rosa, a family of rhombus tilings with a 2n-fold
rotat...
In our article in MCU'2013 we state the the Domino problem is undecidabl...
We prove that the SubRosa substitution tilings with 2n-fold rotational
s...
A two-dimensional configuration is a coloring of the infinite grid Z^2 w...
We investigate the tiling problem, also known as the domino problem, tha...
This article studies the complexity of the word problem in groups of
aut...
We study Nivat's conjecture on algebraic subshifts and prove that in som...
Two cellular automata are strongly conjugate if there exists a
shift-com...