1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015
Quasiperiodicity and non-computability in tilings
Bruno Durand, Andrei Romashchenko
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic an…
cs.DM2010★ 1 cited
1D Effectively Closed Subshifts and 2D Tilings
Durand Bruno, Alexander Shen, Andrei Romashchenko
Michael Hochman showed that every 1D effectively closed subshift can be simulated by a 3D subshift of finite type and asked whether the same can be done in 2D. It turned out that t…