License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2019.53
URN: urn:nbn:de:0030-drops-102926
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10292/
Go to the corresponding LIPIcs Volume Portal

Mottet, Antoine ; Quaas, Karin

The Containment Problem for Unambiguous Register Automata

pdf-format:
LIPIcs-STACS-2019-53.pdf (0.6 MB)

Abstract

We investigate the complexity of the containment problem "Does L(A)subseteq L(B) hold?", where B is an unambiguous register automaton and A is an arbitrary register automaton. We prove that the problem is decidable and give upper bounds on the computational complexity in the general case, and when B is restricted to have a fixed number of registers.

BibTeX - Entry

@InProceedings{mottet_et_al:LIPIcs:2019:10292,
  author =	{Antoine Mottet and Karin Quaas},
  title =	{{The Containment Problem for Unambiguous Register Automata}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{53:1--53:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Rolf Niedermeier and Christophe Paul},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10292},
  doi =		{10.4230/LIPIcs.STACS.2019.53},
  annote =	{Keywords: Data words, Register automata, Unambiguous Automata, Containment Problem, Language Inclusion Problem}
}

Keywords: Data words, Register automata, Unambiguous Automata, Containment Problem, Language Inclusion Problem
Collection: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Issue Date: 2019
Date of publication: 12.03.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI