1. Two-Way Two-Tape Automata
- Author
-
Léo Exibard, Olivier Serre, Olivier Carton, Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Lyon (ENS Lyon), École normale supérieure de Lyon (ENS de Lyon), and Serre, Olivier
- Subjects
010302 applied physics ,Discrete mathematics ,FOS: Computer and information sciences ,[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO] ,TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES ,Formal Languages and Automata Theory (cs.FL) ,Closure (topology) ,[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] ,Computer Science - Formal Languages and Automata Theory ,0102 computer and information sciences ,Composition (combinatorics) ,Nonlinear Sciences::Cellular Automata and Lattice Gases ,01 natural sciences ,Automaton ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,010201 computation theory & mathematics ,multi-tape automata ,complementation ,alternating ,0103 physical sciences ,Computer Science::Formal Languages and Automata Theory ,Mathematics ,Sciences exactes et naturelles - 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., Developments in Language Theory (DLT) 2017, info:eu-repo/semantics/published
- Published
- 2017