Turing machines with sublogarithmic space
著者
書誌事項
Turing machines with sublogarithmic space
（Lecture notes in computer science, 843）
Springer-Verlag, c1994
- : gw
- : us
大学図書館所蔵 件 / 全59件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. [111]-112
Includes indexes
内容説明・目次
内容説明
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 book presents the key results on space complexity, also as regards the classes of languages acceptable, under the perspective of a sublogarithmic number of cells used during computation. It originates from courses given by the author at the Technical University of Gdansk and Gdansk University in 1991 and 1992. It was finalized in 1994 when the author visited Paderborn University and includes the most recent contributions to the field.
目次
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.
「Nielsen BookData」 より