Turing Machines With Sublogarithmic Space
Download Turing Machines With Sublogarithmic Space PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Turing Machines With Sublogarithmic Space book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
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 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.
Algorithms and Computation
Author: Toshihide Ibaraki
language: en
Publisher: Springer Science & Business Media
Release Date: 2003-12-03
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
Grammars and Automata for String Processing
The conventional wisdom was that biology influenced mathematics and computer science. But a new approach has taken hold: that of transferring methods and tools from computer science to biology. The reverse trend is evident in Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology and Back. The contributors address the structural (syntactical) view of the domain. Mathematical linguistics and computer science can offer various tools for modeling complex macromolecules and for analyzing and simulating biological issues. This collection is valuable for students and researchers in biology, computer science, and applied mathematics.