License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2019.40
URN: urn:nbn:de:0030-drops-116027
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11602/
Go to the corresponding LIPIcs Volume Portal


Filiot, Emmanuel ; Guha, Shibashis ; Mazzocchi, Nicolas

Two-Way Parikh Automata

pdf-format:
LIPIcs-FSTTCS-2019-40.pdf (0.6 MB)


Abstract

Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer theory, as they enjoy a decidable emptiness problem. In this paper, we study two-way Parikh automata. We show that emptiness becomes undecidable in the non-deterministic case. However, it is PSpace-C when the number of visits to any input position is bounded and the semi-linear set is given as an existential Presburger formula. We also give tight complexity bounds for the inclusion, equivalence and universality problems. Finally, we characterise precisely the complexity of those problems when the semi-linear constraint is given by an arbitrary Presburger formula.

BibTeX - Entry

@InProceedings{filiot_et_al:LIPIcs:2019:11602,
  author =	{Emmanuel Filiot and Shibashis Guha and Nicolas Mazzocchi},
  title =	{{Two-Way Parikh Automata}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{40:1--40:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Arkadev Chattopadhyay and Paul Gastin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11602},
  URN =		{urn:nbn:de:0030-drops-116027},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.40},
  annote =	{Keywords: Parikh automata, two-way automata, Presburger arithmetic}
}

Keywords: Parikh automata, two-way automata, Presburger arithmetic
Seminar: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Issue Date: 2019
Date of publication: 10.12.2019


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