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.2018.45
URN: urn:nbn:de:0030-drops-84839
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8483/
Köcher, Chris
Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
| pdf-format: |
|
Abstract
Partially lossy queue monoids (or plq monoids) model the behavior of queues that can forget arbitrary parts of their content. While many decision problems on recognizable subsets in the plq monoid are decidable, most of them are undecidable if the sets are rational. In particular, in this monoid the classes of rational and recognizable subsets do not coincide. By restricting multiplication and iteration in the construction of rational sets and by allowing complementation we obtain precisely the class of recognizable sets. From these special rational expressions we can obtain an MSO logic describing the recognizable subsets. Moreover, we provide similar results for the class of aperiodic subsets in the plq monoid.
BibTeX - Entry
@InProceedings{kcher:LIPIcs:2018:8483,
author = {Chris K{\"o}cher},
title = {{Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Rolf Niedermeier and Brigitte Vall{\'e}e},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8483},
URN = {urn:nbn:de:0030-drops-84839},
doi = {10.4230/LIPIcs.STACS.2018.45},
annote = {Keywords: Partially Lossy Queues, Transformation Monoid, Rational Sets, Recognizable Sets, Aperiodic Sets, MSO logic}
}
| Keywords: | Partially Lossy Queues, Transformation Monoid, Rational Sets, Recognizable Sets, Aperiodic Sets, MSO logic | |
| Seminar: | 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 27.02.2018 |
