Sliding window property testing for regular languages
Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya

TL;DR
This paper introduces ultra-efficient sliding window property testing algorithms for regular languages, achieving logarithmic and constant space complexities for deterministic and randomized testers, respectively, in streaming models.
Contribution
It combines sliding window models with property testing, providing the first ultra-efficient algorithms for recognizing regular languages in streaming settings.
Findings
Deterministic testers use logarithmic space.
Randomized testers with two-sided error use constant space.
The approach extends previous space complexity characterizations to property testing.
Abstract
We study the problem of recognizing regular languages in a variant of the streaming model of computation, called the sliding window model. In this model, we are given a size of the sliding window and a stream of symbols. At each time instant, we must decide whether the suffix of length of the current stream ("the active window") belongs to a given regular language. Recent works showed that the space complexity of an optimal deterministic sliding window algorithm for this problem is either constant, logarithmic or linear in the window size and provided natural language theoretic characterizations of the space complexity classes. Subsequently, those results were extended to randomized algorithms to show that any such algorithm admits either constant, double logarithmic, logarithmic or linear space complexity. In this work, we make an important step forward and combine the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
