On tape-bounded complexity classes and multihead finite automata
TLDR
The principal result described in this paper is the equivalence of the following statements: every set accepted by a nondeterministic one-way two-head finite automaton can be acceptance by a deterministic two-way k-head infinite automaton.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1975-02-01 and is currently open access. It has received 75 citations till now. The article focuses on the topics: Linear bounded automaton & Pushdown automaton.read more
Citations
More filters
Journal ArticleDOI
Space-bounded reducibility among combinatorial problems
TL;DR: Two versions of the polynomial time-reducibility of Cook and Karp are defined, by means of Turing machines and by bounded-quantifier formulas, and they are shown to be complete for nondeterministic (deterministic) log n space.
Journal ArticleDOI
Finite state machines for strings over infinite alphabets
TL;DR: This work investigates the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems of Kaminski and Francez on register automata.
Journal ArticleDOI
Relativization of questions about log space computability
Richard E. Ladner,Nancy Lynch +1 more
TL;DR: A notion of log space Turing reducibility is introduced and it is shown that there exists a computable setA such that and.
Journal ArticleDOI
Prediction-preserving reducibility
Leonard Pitt,Manfred K. Warmuth +1 more
TL;DR: A model of polynomial-time concept prediction is investigated which is a relaxation of the distribution-independent model of concept learning due to Valiant and prediction-preserving reductions are defined and are shown to be effective tools for comparing the relative difficulty of solving various prediction problems.
Journal ArticleDOI
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
TL;DR: The equivalence of the following statements, for 0 g ~ < 1, m shown by describing a log(n)-complete hnear language, is shown.
References
More filters
Book
Formal Languages and Their Relation to Automata
TL;DR: The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
Journal ArticleDOI
Relationships between nondeterministic and deterministic tape complexities
TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.
Proceedings ArticleDOI
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer,A. R. Meyer +1 more
TL;DR: A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
Journal ArticleDOI
On non-determinancy in simple computing devices
TL;DR: The main result shows that if any set accepted by such a 3-head non-deterministic Turing machine can be accepted by a deterministic Turing Machine with more read-only heads, then the deterministic and non-Deterministic context-sensitive languages are identical.
Journal ArticleDOI
On two-way multihead automata
TL;DR: It is shown that deterministic two-way finite automata with n+2 heads are strictly more powerful than deterministicTwo- way finite automATA with n heads for each positive integer n.