Two-Way Two-Tape Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Two-Way Two-Tape Automata

Résumé

In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alternating automata are not closed under composition.
Fichier principal
Vignette du fichier
1710.00213.pdf (172.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02112626 , version 1 (26-04-2019)

Identifiants

  • HAL Id : hal-02112626 , version 1

Citer

Olivier Carton, Léo Exibard, Olivier Serre. Two-Way Two-Tape Automata. Developments in Language Theory - 21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159. ⟨hal-02112626⟩
30 Consultations
206 Téléchargements

Partager

Gmail Facebook X LinkedIn More