On universality of regular realizability problems
Formal Languages and Automata Theory
2024-10-11 v3
Abstract
We prove the universality of the regular realizability problems for several classes of filters. The filters are encodings 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 disjunctive truth table polynomial reductions for unary relations and polynomial space reductions for invariant binary relations. Stronger reductions correspond to the results of P. Wolf and H. Fernau about decidability of regular realizability problems for many graph-theoretic properties.
Cite
@article{arxiv.2311.15381,
title = {On universality of regular realizability problems},
author = {Alexander Rubtsov and Michael Vyalyi},
journal= {arXiv preprint arXiv:2311.15381},
year = {2024}
}