The LBA Problem and its Importance in the Theory of Computing
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.contributor.author | Hunt, Harry B., III | en_US |
| dc.date.accessioned | 2007-04-19T19:03:21Z | |
| dc.date.available | 2007-04-19T19:03:21Z | |
| dc.date.issued | 1973-05 | en_US |
| dc.description.abstract | In this paper we study the classic problem of determining whether the deterministic and non-deterministic context-sensitive languages are the same or, equivalently, whether the languages accepted by deterministic and non-deterministic linearly bounded automata are the same. We show that this problem is equivalent to several other natural problems in the theory of computing and that the techniques used on the LDA problem have several other applications in complexity theory. For example, we show that there exists a hardest-tape recognizable non-deterministic context-sensitive language $L_{1}$, such that $L_{1}$ is a deterministic context-sensitive language if and only if the deterministic and non-deterministic context-sensitive languages are the same. We show furthermore, that many decision problems about sets described by regular expressions are instances of these tape-hardest recognizable context-sensitive languages. Thus, it follows that non-determinism in Turing machine computations (using at least linear tape) can not save memory over deterministic Turing machine computations if and only if the equivalence of regular expressions can be decided by a deterministic linearly bounded automaton. It also follows that the equivalence of regular expressions can be decided by a non-deterministic linearly bounded automaton if and only if the family of context-sensitive languages is closed under complementation. | en_US |
| dc.format.extent | 2825679 bytes | |
| dc.format.extent | 849289 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/TR73-171 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6015 | |
| 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 | The LBA Problem and its Importance in the Theory of Computing | en_US |
| dc.type | technical report | en_US |