Autor:	Carton, Olivier, Exibard, Léo, Serre, Olivier
Rok vydání:	2017
Předmět:	Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
DOI:	10.1007/978-3-319-62809-7_10
Popis:	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. Comment: Developments in Language Theory 2017
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1710.00213 Zobrazit plný text záznamu View this record from Arxiv