Two-way Two-tape Automata
Formal Languages and Automata Theory
2017-10-03 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1710.00213,
title = {Two-way Two-tape Automata},
author = {Olivier Carton and Léo Exibard and Olivier Serre},
journal= {arXiv preprint arXiv:1710.00213},
year = {2017}
}
Comments
Developments in Language Theory 2017