Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

Authors:
Ronald V. Book;Sheila A. Greibach;Ben Wegbreit
Affiliations:
Harvard University;University of California at Los Angeles;Harvard University
Venue:
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Year:
1970

Citing 6
Cited 1

Real-Time Definable Languages

Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines

Journal of the ACM (JACM)
Toward a Theory of Enumerations

Journal of the ACM (JACM)
Quasi-realtime languages (Extended Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal languages and their relation to automata

Formal languages and their relation to automata

Writing stack acceptors

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied with the aim of showing sufficient conditions for these classes to be AFLs and to be principal AFLs.