Show simple item record

dc.contributor.authorCases Muñoz, Rafael
dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.date.accessioned2017-11-15T15:06:56Z
dc.date.available2017-11-15T15:06:56Z
dc.date.issued1985
dc.identifier.citationCases, R., Gabarro, J. "About log-on languages : preliminary version". 1985.
dc.identifier.urihttp://hdl.handle.net/2117/110688
dc.description.abstractWe 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.
dc.format.extent15 p.
dc.language.isoeng
dc.relation.ispartofseriesRR 85/02
dc.subjectÀrees temàtiques de la UPC::Informàtica::Llenguatges de programació
dc.subject.lcshTuring machines
dc.titleAbout log-on languages : preliminary version
dc.typeExternal research report
dc.subject.lemacTuring, Màquines de
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
drac.iddocument21604938
dc.description.versionPostprint (published version)
upcommons.citation.authorCases, R., Gabarro, J.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder