We revisit the membership problem for subclasses of rational relations o...
We study first-order logic (FO) over the structure consisting of finite ...
Low-latency sliding window algorithms for regular and context-free langu...
Automatic structures are infinite structures that are finitely represent...
The most fundamental problem considered in algorithms for text processin...
In grammar-based compression a string is represented by a context-free
g...
We prove new complexity results for computational problems in certain wr...
We study the problem of recognizing regular languages in a variant of th...
It is shown that a context-free grammar of size m that produces a single...
In this paper the computational complexity of the (bi)simulation problem...
A sliding window algorithm receives a stream of symbols and has to outpu...