Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)
Ronald V. Book, Sheila A. Greibach, Ben Wegbreit · 1970
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.