par Carton, Olivier;Exibard, Leo 
;Serre, Olivier
Editeur scientifique Charlier, Emilie;Leroy, Julien;Rigo, Michel
Référence Developments in Language Theory(21: August 7-11: Liège, Belgium), Lecture Notes in Computer Science, Springer, Vol. 10396, page (147-159)
Publication Publié, 2017-07-21
;Serre, OlivierEditeur scientifique Charlier, Emilie
;Leroy, Julien;Rigo, MichelRéférence Developments in Language Theory(21: August 7-11: Liège, Belgium), Lecture Notes in Computer Science, Springer, Vol. 10396, page (147-159)
Publication Publié, 2017-07-21
Publication dans des actes
| 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. |
