Relationships Between Nondeterministic and Deterministic Tape Complexities

  title={Relationships Between Nondeterministic and Deterministic Tape Complexities},
  author={Walter J. Savitch},
  journal={J. Comput. Syst. Sci.},
  • W. Savitch
  • Published 1 April 1970
  • Computer Science
  • J. Comput. Syst. Sci.
On Tape-Bounded Complexity Classes and Multi-Head Finite Automata
The principal result described in this paper is the equivalence of the following statements: (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a
A Note Concerning Nondeterministic Tape Complexities
A set of sufficient condit ions on tape funct ions Ll(n) and L2(n) is presented t h a t guarantees the existence of a set accepted by an Ll (n) tape bounded nondeterminis t ic Turing machine, bu t
Computations with a restricted number of nondeterministic steps (Extended Abstract)
This paper directs its efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with restricted amounts of nond determinism.
Maze recognizing automata (Extended Abstract)
In [2], computations of nondeterministic machines are shown to correspond to threadings of certain mazes and a new device called a maze-recognizing automaton is introduced, a type of finite-state device that crawled through mazes.
On efficient deterministic simulation of turing machine computations below logaspace
  • B. Litow
  • Computer Science
    Mathematical systems theory
  • 2005
It is shown that a bounded language accepted by a nondeterministic Turing machine in spaceS(n ∈o(logn) can be accepted by a deterministic Turing machine in space MAX {(s(nn))2, logn}. This can be
Tally Languages and Complexity Classes
On the time and tape complexity of languages I
This work investigates the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines and the complexity of many predicates about stack automata and finds several problems with nonpolynomial lower complexity bounds.
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time
It is proved a polynomial blowup from two-way nondeterministic finite automata into equivalent weight-reducing one-tape deterministic machines that work in linear time.
Finite-Change Automata
This paper introduces a new storage medium with properties between space and time: the finite-change tape (FC-tape), a Turing tape, on which every cell can be changed only a bounded number of times.


Deterministic simulation of non-deterministic turing machines (Detailed Abstract)
It is shown that a non-deterministic L(n)-tape bounded Turing machine can be simulated by an (L(n))2-tape bound Turing machine, provided L( n)≥log2n.
Classes of computable functions defined by bounds on computation: Preliminary Report
The structure of the functions computable in time or space bounded by t is investigated for recursive functions t. The t-computable classes are shown to be closed under increasing recursively
A Machine-Independent Theory of the Complexity of Recursive Functions
The number of steps required to compute a function depends on the type of computer that is used, on the choice of computer program, and on the input-output code, but the results obtained in this paper are nearly independent of these considerations.
Memory bounds for recognition of context-free and context-sensitive languages
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of
Relations Between Time and Tape Complexities
It is shown that if a language L is recognized by a (nondeterministic) single-tape Turing machine of time complexity T(n)(n), then L isrecognized by an offline Turing Machine of tape complexity T.T.(n).
The Recognition Problem for the Set of Perfect Squares
Lower bounds on the capacity and on the product of capacity and computation time are obtained for machines which recognize the set of squares and a machine which carries out a test based on the standard root-extraction algorithm is substantially less efficient in this respect.
Formal Languages and their Relation to Automata
Relationship Between Nondeterministic and Deterministic Tape Complexities
  • Journal of Computer and system science
  • 1970