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.29
URN: urn:nbn:de:0030-drops-102688
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10268/
Ganardi, Moses
Visibly Pushdown Languages over Sliding Windows
| pdf-format: |
|
Abstract
We investigate the class of visibly pushdown languages in the sliding window model. A sliding window algorithm for a language L receives a stream of symbols and has to decide at each time step whether the suffix of length n belongs to L or not. The window size n is either a fixed number (in the fixed-size model) or can be controlled by an adversary in a limited way (in the variable-size model). The main result of this paper states that for every visibly pushdown language the space complexity in the variable-size sliding window model is either constant, logarithmic or linear in the window size. This extends previous results for regular languages.
BibTeX - Entry
@InProceedings{ganardi:LIPIcs:2019:10268,
author = {Moses Ganardi},
title = {{Visibly Pushdown Languages over Sliding Windows}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {29:1--29:17},
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/10268},
doi = {10.4230/LIPIcs.STACS.2019.29},
annote = {Keywords: visibly pushdown languages, sliding windows, rational transductions}
}
| Keywords: | visibly pushdown languages, sliding windows, rational transductions | |
| Seminar: | 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 12.03.2019 |
