Tape-bounded turing acceptors and principal AFLs

Authors:
Ronald V. Book;Sheila A. Greibach;Oscar H. Ibarra;Ben Wegbreit
Affiliations:
-;-;-;-
Venue:
Journal of Computer and System Sciences
Year:
1970

Citing 3
Cited 2

A generator of context-sensitive languages

Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Nonerasing stack automata

Journal of Computer and System Sciences

Comparing complexity classes

Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conditions are given under which the classes of formal languages defined by non-deterministic (deterministic) tape-bounded Turing acceptors will be principal AFLs.