2 citations · 2 across the 4 of their papers we have counts for
3 papers · 1 filter
Minimality and computability of languages of G-shifts
Djamel Eddine Amir, Benjamin Hellouin de Menibus
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for -shifts, where is a finitely generated…
Subshifts defined by nondeterministic and alternating plane-walking automata
Benjamin Hellouin de Menibus, Pacôme Perrotin
Plane-walking automata were introduced by Salo & Törma to recognise languages of two-dimensional infinite words (subshifts), the counterpart of -way finite automata for two-dime…
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…