Cited By
View all- Fischer P(1965)Multi-tape and infinite-state automata—a surveyCommunications of the ACM10.1145/365691.3659628:12(799-805)Online publication date: 1-Dec-1965
On computability by certain classes of restricted turing machines
Pages 23 - 32
Abstract
The theory of abstract machines has been well developed for the finite automaton [RS] and the Turing machine [D]. More recently, machines intermediate in computing power between the above two classes of machines have been investigated. These machines have some form of unbounded memory, thus giving them more potential computing ability than the finite automata, but the access to the unbounded memory is restricted in some way so that they do not have the full power of a Turing machine. The two forms of restricted unbounded memory we shall consider here are the counter and the pushdown store.
Index Terms
- On computability by certain classes of restricted turing machines
Index terms have been assigned to the content through auto-classification.
Recommendations
Some properties of one-pebble turing machines with sublogarithmic space
This paper investigates some aspects of the accepting powers of deterministic, nondeterministic, and alternating one-pebble Turing machines with spaces between log log n and log n. We first investigate a relationship between the accepting powers of two-...
A note on one-pebble two-dimensional Turing machines
This paper investigates a relationship among the accepting powers of deterministic, nondeterministic, and alternating one-pebble two-dimensional Turing machines, and shows that 1. nondeterminism are more powerful than determinism for o(log n) space-...
Theory of one-tape linear-time Turing machines
A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues ...
Comments
Information & Contributors
Information
Published In
October 1963
150 pages
Publisher
IEEE Computer Society
United States
Publication History
Published: 28 October 1963
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
Cited By
View all- Fischer P(1965)Multi-tape and infinite-state automata—a surveyCommunications of the ACM10.1145/365691.3659628:12(799-805)Online publication date: 1-Dec-1965