Two-way automata with more than one storage medium
Jörg Vogel,Klaus W. Wagner +1 more
Reads0
Chats0
TLDR
If the number of checking stacks is fixed, then the computational power of the corresponding restricted classes of automata can also be characterized in terms of time and space complexity classes.About:
This article is published in Theoretical Computer Science.The article was published on 1985-01-01 and is currently open access. It has received 4 citations till now. The article focuses on the topics: Nested stack automaton & Quantum finite automata.read more
Citations
More filters
Journal ArticleDOI
Iterated stack automata and complexity classes
TL;DR: 1-way iterated pushdown automata form a proper hierarchy with respect to the number of iterations, and their emptiness problem is complete in deterministic iterated exponential time.
Journal Article
Review: Marvin L. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in the Theory of Turing Machines
Journal ArticleDOI
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
Oscar H. Ibarra,Ian McQuillan +1 more
TL;DR: This work examines different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite finite stacks.
Journal ArticleDOI
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
Oscar H. Ibarra,Ian McQuillan +1 more
TL;DR: In this article , a synchronous deterministic pushdown automata model with non-erasing stacks was studied, where the machine starts reading from the stacks at most a linear number of times.
References
More filters
Journal ArticleDOI
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
TL;DR: The main results of this paper show that the same notions of computability can be realized within the highly restricted monogenic formal systems called by Post the "Tag" systems, and within a peculiarly restricted variant of Turing machine which has two tapes, but can neither write on nor erase these tapes.
Journal ArticleDOI
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
TL;DR: A class of machines called auxiliary pushdown machines is introduced, characterized in terms of time-bounded Turing machines, and corollaries are derived which answer some open questions in the field.
Journal ArticleDOI
Classes of predictably computable functions
TL;DR: A sequence of classes of computable functions for which a prediction of the complexity of the calculation may be made in a comparatively simple fashion, each defined as the class of functions whose computational complexity is "predictable" by a function in the preceding class.
Journal ArticleDOI
Counter machines and counter languages
TL;DR: The languages recognizing by time- and space-restricted multiple-counter machines are compared to the languages recognizable by similarly restricted multipletape Turing machines.
Journal ArticleDOI
Time and tape complexity of pushdown automaton languages
TL;DR: This paper considers languages defined by pushdown store systems and investigates how much time and memory is needed in order to de- termine whether an arbitrary input sentence belongs or does not belong to some language in this class.