Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.contributor.author | Mahaney, Stephen R. | en_US |
| dc.date.accessioned | 2007-04-23T16:38:46Z | |
| dc.date.available | 2007-04-23T16:38:46Z | |
| dc.date.issued | 1980-02 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 824346 bytes | |
| dc.format.extent | 368178 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-413 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6253 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata | en_US |
| dc.type | technical report | en_US |