2 citations · 2 across the 2 of their papers we have counts for
3 papers
Necessary conditions for tiling finitely generated amenable groups
Benjamin Hellouin de Menibus, Hugo Maturana Cornejo
We consider a set of necessary conditions which are efficient heuristics for deciding when a set of Wang tiles cannot tile a group. Piantadosi gave a necessary and sufficient condi…
Nontrivial Turmites are Turing-universal
Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus +1
A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, d…
Entry times in automata with simple defect dynamics
Benjamin Hellouin De Menibus, Mathieu Sablik
In this paper, we consider a simple cellular automaton with two particles of different speeds that annihilate on contact. Following a previous work by K\r urka et al., we study the…