Communication Dans Un Congrès Année : 2025

Subshifts Defined by Nondeterministic and Alternating Plane-walking Automata

Résumé

Plane-walking automata were introduced by Salo & Törma to recognise languages of two-dimensional infinite words (subshifts), the counterpart of 4-way finite automata for two-dimensional finite words. We extend the model to allow for nondeterminism and alternation of quantifiers. We prove that the recognised subshifts form a strict subclass of sofic subshifts, and that the classes corresponding to existential and universal nondeterminism are incomparable and both larger that the deterministic class. We define a hierarchy of subshifts recognised by plane-walking automata with alternating quantifiers, which we conjecture to be strict.
Fichier principal
Vignette du fichier
automate.pdf (736) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
licence

Dates et versions

hal-04951292 , version 1 (17-02-2025)

Licence

Identifiants

Citer

Benjamin Hellouin de Menibus, Pacôme Perrotin. Subshifts Defined by Nondeterministic and Alternating Plane-walking Automata. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Iena, Germany. pp.56, ⟨10.4230/LIPIcs.STACS.2025.56⟩. ⟨hal-04951292⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More