Now showing items 1-1 of 1

    • Turing machines with few accepting computations 

      Torán Romero, Jacobo; Köbler, Johannes (1988)
      External research report
      Open Access
      In this paper we study complexity classes defined by path-restricted nondeterministic machines. We prove that for every language L in the class Few a polynomial time nondeterministic machine can be constructed which has ...