All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00427248" target="_blank" >RIV/67985807:_____/17:00427248 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.3233/FI-2017-1544" target="_blank" >http://dx.doi.org/10.3233/FI-2017-1544</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3233/FI-2017-1544" target="_blank" >10.3233/FI-2017-1544</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

  • Original language description

    We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on nondeterministic Turing machines with ‘one-sided’ advice. We prove that these machines precisely accept the co-RE languages, without restriction on the advice functions that are used. We show that for accepting a co-RE language, one-sided advice is as powerful as arbitrary advice, but also that linearly bounded one-sided advice is sufficient. However, ‘long’ sublinear advice can make Turing machines with one-sided advice accept more co-RE languages than ‘short’ sublinear advice. We prove that infinite proper hierarchies of language classes inside co-RE can be devised, using suitable increasing sequences of bounding functions for the allowed advice. The machine model and the results dualize for the family of recursively enumerable languages.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Fundamenta Informaticae

  • ISSN

    0169-2968

  • e-ISSN

  • Volume of the periodical

    153

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    20

  • Pages from-to

    347-366

  • UT code for WoS article

    000407178200003

  • EID of the result in the Scopus database

    2-s2.0-85027179425