LIPIcs.FSTTCS.2016.18.pdf
- Filesize: 488 kB
- 14 pages
We study the space complexity of querying regular languages over data streams in the sliding window model. The algorithm has to answer at any point of time whether the content of the sliding window belongs to a fixed regular language. A trichotomy is shown: For every regular language the optimal space requirement is either in Theta(n), Theta(log(n)), or constant, where $n$ is the size of the sliding window.
Feedback for Dagstuhl Publishing