Two-way Two-tape Automata
Olivier Carton, L\'eo Exibard, Olivier Serre
TL;DR
This paper investigates two-way two-tape automata, revealing they are not closed under complementation or composition for non-unary alphabets, thus advancing understanding of their computational limitations.
Contribution
It demonstrates non-closure properties of two-way two-tape automata under complementation and composition, extending previous results to broader alphabet classes.
Findings
Automata are not closed under complementation for non-unary alphabets.
Automata are not closed under composition.
Extends prior results from picture languages to general automata.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · semigroups and automata theory · Software Testing and Debugging Techniques