Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2011, Volume 47, Issue 4, Pages 43–54 (Mi ppi2059)  
This article is cited in 9 scientific papers (total in 9 papers)

Large Systems

On regular realizability problems

M. N. Vyalyi

Dorodnitsyn Computing Centre of the Russian Academy of Sciences
Full-text PDF (170 kB) Citations (9)
References:
PDF
HTML
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.
Received: 08.02.2011
Revised: 16.06.2011
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 4, Pages 342–352
DOI: https://doi.org/10.1134/S003294601104003X
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.7
Language: Russian
Citation: M. N. Vyalyi, “On regular realizability problems”, Probl. Peredachi Inf., 47:4 (2011), 43–54; Problems Inform. Transmission, 47:4 (2011), 342–352
Citation in format AMSBIB
\Bibitem{Vya11}
\by M.~N.~Vyalyi
\paper On regular realizability problems
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 4
\pages 43--54
\mathnet{http://mi.mathnet.ru/ppi2059}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2933441}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 4
\pages 342--352
\crossref{https://doi.org/10.1134/S003294601104003X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299373700003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84856820549}
Linking options:
  • https://www.mathnet.ru/eng/ppi2059
  • https://www.mathnet.ru/eng/ppi/v47/i4/p43
    • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:500
    Full-text PDF :99
    References:49
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024