Turing Machines with Sublogarithmic Space
This comprehensive monograph investigates the computational power of Turing machines with sublogarithmic space. The studies are devoted to the Turing machine model introduced by Stearns, Hartmanis, and Lewis (1965) with a two-way read-only input tape and a separate two-way read-write work tape. The...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1994, 1994
|
| Edition: | 1st ed. 1994 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Basic Notions
- Languages acceptable with logarithmic space
- Examples of languages acceptable with sublogarithmic space
- Lower bounds for accepting non-regular languages
- Space constructible functions
- Halting property and closure under complement
- Strong versus weak mode of space complexity
- Padding
- Deterministic versus nondeterministic Turing machines
- Space hierarchy
- Closure under concatenation
- Alternating hierarchy
- Independent complement
- Other models of Turing machines