Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Authors:
Oscar H. Ibarra
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1971

Citing 10
Cited 8

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Stack automata and compiling

Journal of the ACM (JACM)
Halting Stack Automata

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata
Two characterizations of the context-sensitive languages

SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Writing stack acceptors

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Checking automata and one-way stack languages

Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Nonerasing stack automata

Journal of Computer and System Sciences

Alternating and Empty Alternating Auxiliary Stack Automata

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Models of a Nondeterministic Computation

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On two-way multihead automata

Journal of Computer and System Sciences
Two-way nested stack automata are equivalent to two-way stack automata

Journal of Computer and System Sciences
Balanced queries: divide and conquer

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Nodes connected by path languages

DLT'11 Proceedings of the 15th international conference on Developments in language theory
On regular realizability problems

Problems of Information Transmission
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several classes of multihead and auxiliary stack automata are introduced and are used to characterize some tape and time complexity classes of Turing machines.