Turing machines with few accepting computations
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 f(x)+1 accepting paths for strings x ¿ L, and f(x) accepting paths for strings t...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1988 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/189375 |
| Acceso en línea: | https://hdl.handle.net/2117/189375 |
| Access Level: | acceso abierto |
| Palabra clave: | Turing machines Turing, Màquines de Àrees temàtiques de la UPC::Informàtica |
| Sumario: | 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 f(x)+1 accepting paths for strings x ¿ L, and f(x) accepting paths for strings that are not in L, being f a function in PF. From this result we obtain lowness properties of the class Few, and positive relativizations of different counting classes. |
|---|