On regular realizability problems

Authors:
M. N. Vyalyi
Affiliations:
Computing Center of the Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 6
Cited 1

A note on succinct representations of graphs

Information and Control
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
On Models of a Nondeterministic Computation

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

On expressive power of regular realizability problems

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the class of regular realizability problems. Any of such problems is specified by some language (filter) and consists in verifying that the intersection of a given regular language and the filter is nonempty. The main question is diversity of the computational complexity of such problems. We show that any regular realizability problem with an infinite filter is hard for a class of problems decidable in logarithmic space with respect to logarithmic reductions. We give examples of NP-complete and PSPACE-complete regular realizability problems.