About log-on languages : preliminary version
We deal with on-line log-space Turing Machines with markers in the work tapes. In this type of machines we prove the existence of a language L satisfying L ϵ NSPACE_s (log n) , L ̅ ϵ NSPACE_s (log n) and L ϵ NSPACE_s (log n) We give an explicit definition of L. The main theorem uses minimisation...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1985 |
| 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/110688 |
| Acceso en línea: | https://hdl.handle.net/2117/110688 |
| Access Level: | acceso abierto |
| Palabra clave: | Turing machines Turing, Màquines de Àrees temàtiques de la UPC::Informàtica::Llenguatges de programació |
| Sumario: | We deal with on-line log-space Turing Machines with markers in the work tapes. In this type of machines we prove the existence of a language L satisfying L ϵ NSPACE_s (log n) , L ̅ ϵ NSPACE_s (log n) and L ϵ NSPACE_s (log n) We give an explicit definition of L. The main theorem uses minimisation techniques of deterministic finite automata. |
|---|