License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.117
URN: urn:nbn:de:0030-drops-74971
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7497/
Go to the corresponding LIPIcs Volume Portal


Clemente, Lorenzo ; Czerwinski, Wojciech ; Lasota, Slawomir ; Paperman, Charles

Regular Separability of Parikh Automata

pdf-format:
LIPIcs-ICALP-2017-117.pdf (0.5 MB)


Abstract

We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we surprisingly show decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is disjoint from the other? We supplement this result by proving undecidability of the same problem already for languages of visibly one counter automata.

BibTeX - Entry

@InProceedings{clemente_et_al:LIPIcs:2017:7497,
  author =	{Lorenzo Clemente and Wojciech Czerwinski and Slawomir Lasota and Charles Paperman},
  title =	{{Regular Separability of Parikh Automata}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{117:1--117:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7497},
  URN =		{urn:nbn:de:0030-drops-74971},
  doi =		{10.4230/LIPIcs.ICALP.2017.117},
  annote =	{Keywords: Regular separability problem, Parikh automata, integer vector addition systems, visible one counter automata, decidability, undecidability}
}

Keywords: Regular separability problem, Parikh automata, integer vector addition systems, visible one counter automata, decidability, undecidability
Seminar: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 06.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI