2012/11/03 by M. Vyalyi, Mikhail N. Vyalyi, Vyalyi, Mikhail N.
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Machine Learning and Algorithms #cs.CC #cs.FL #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1211.0606
Submitted to Problems of Information Transmission. Corrected and extended version, main results are the same
openalex publication_date 2012/11/03 · arxiv created 2012/12/29 · arxiv updated 2013/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem equivalent to L under disjunctive reductions on nondeterministic log space. It implies that for any level of polynomial hierarchy there exists complete RR problem under polynomial reductions.