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...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
843 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Turing machines with sublogarithmic space, Andrzej Szepietowski, Berlin, Springer-Verlag, 1994, 1 vol. (VIII-114 p.), Lecture notes in computer science, 0-387-58355-6 • Turing Machines with Sublogarithmic Space, Texte imprimé, 9783662192689 |
Taula de continguts:
- 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.