Two-way two-tape automata

Olivier Carton, Léo Exibard, Olivier Serre

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 21st International Conference, DLT 2017, Proceedings
EditorsEmilie Charlier, Julien Leroy, Michel Rigo
PublisherSpringer Verlag
Pages147-159
Number of pages13
ISBN (Print)9783319628080
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes
Event21st International Conference on Developments in Language Theory, DLT 2017 - Liege, Belgium
Duration: 7 Aug 201711 Aug 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10396 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Conference on Developments in Language Theory, DLT 2017
Country/TerritoryBelgium
CityLiege
Period7/08/1711/08/17

Keywords

  • Alternating
  • Complementation
  • Multi-tape automata

Fingerprint

Dive into the research topics of 'Two-way two-tape automata'. Together they form a unique fingerprint.

Cite this