Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6253
Title: Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
Authors: Hartmanis, Juris
Mahaney, Stephen R.
Keywords: computer science
technical report
Issue Date: Feb-1980
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-413
Abstract: In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan their input only once and relate their computational power to two-way, $\log n$-tape automata. We show that for the one-way, $\log n$-tape automata the nondeterministic model (1-NL) is computationally much more powerful than the deterministic model (1-L); that under one-way, $\log n$-tape reductions there exist natural complete languages for these automata and that the complete languages cannot be sparse. Furthermore, we show that any language complete for nondeterministic one-way $\log n$-tape automata (under 1-L reductions) is also complete for the computationally more powerful nondeterministic two-way, $\log n$-tape reductions. Therefore, for all bounds $T(n),T(n \geq \log n$, the deterministic and nondeterministic $T(n)$-tape bounded computations collapse if the nondeterministic one-way $\log n$-tape computations can be carried out by two-way deterministic $\log n$-tape automata.
URI: http://hdl.handle.net/1813/6253
Appears in Collections:Computer Science Technical Reports
Hartmanis, Juris

Files in This Item:

File Description SizeFormat
80-413.pdf805.03 kBAdobe PDFView/Open
80-413.ps359.55 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us