Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
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…
cs.FL2025
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-dim…