Randomized sliding window algorithms for regular languages

02/21/2018
by   Moses Ganardi, et al.
0

A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last n symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most ϵ, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized by the error bound ϵ and the failure ratio ϕ: A randomized sliding window algorithm is required to err with probability at most ϵ at a portion of 1-ϕ of all time instants of an input stream. This work continues the investigation of sliding window algorithms for regular languages. In previous works a trichotomy theorem was shown for deterministic algorithms: the optimal space complexity is either constant, logarithmic or linear in the window size. The main results of this paper concerns three natural settings (randomized algorithms with failure ratio zero and randomized/deterministic algorithms with bounded failure ratio) and provide natural language theoretic characterizations of the space complexity classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2019

Sliding window property testing for regular languages

We study the problem of recognizing regular languages in a variant of th...
research
09/29/2022

Low-Latency Sliding Window Algorithms for Formal Languages

Low-latency sliding window algorithms for regular and context-free langu...
research
04/16/2019

Almost-Smooth Histograms and Sliding-Window Graph Algorithms

We study algorithms for the sliding-window model, an important variant o...
research
10/29/2021

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches

Streaming computation plays an important role in large-scale data analys...
research
01/18/2023

Pseudorandom Generators for Sliding-Window Algorithms

A sliding-window algorithm of window size t is an algorithm whose curren...
research
05/10/2020

Approaching Optimal Duplicate Detection in a Sliding Window

Duplicate detection is the problem of identifying whether a given item h...
research
07/04/2023

Sliding suffix trees simplified

Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...

Please sign up or login with your details

Forgot password? Click here to reset