We consider general computational models: one-way and two-way finite automata, and
logarithmic space Turing machines, all equipped with an auxiliary data structure (ADS). The …

We are lifting classical combinatorial problems from single instances to regular sets of
instances. The task of finding a positive instance of the combinatorial problem P in a …

We prove universality of the regular realizability problems for several classes of filters. The
filters are descriptions of finite relations on the set of non-negative integers in the format …