  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 proposed by P. Wolf and H. Fernau. The
universality has proven up to reductions using NP-oracles. It corresponds to
the results of P. Wolf and H. Fernau about decidability of regular
realizability problems for many graph-theoretic properties.
