Low-latency sliding window algorithms for regular and context-free langu...
We study deterministic and randomized streaming algorithms for word prob...
Whereas for strings, higher-order empirical entropy is the standard entr...
We prove new complexity results for computational problems in certain wr...
We give lower bounds on the complexity of the word problem of certain
no...
We study the problem of recognizing regular languages in a variant of th...
In a seminal paper of Charikar et al. on the smallest grammar problem, t...
In this work we introduce a new succinct variant of the word problem in ...
It is shown that a context-free grammar of size m that produces a single...
The definition of k^th-order empirical entropy of strings is extended to...
In this paper the computational complexity of the (bi)simulation problem...
We study the average size of the minimal directed acyclic graph (DAG) wi...
A sliding window algorithm receives a stream of symbols and has to outpu...
We introduce forest straight-line programs (FSLPs) as a compressed
repre...
It is shown that for a given ordered node-labelled tree of size n and wi...