Tape- and time-bounded Turing acceptors and AFLs (Extended 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.

[1]  Richard Edwin Stearns,et al.  Automata-based computational complexity , 1969, Inf. Sci..

[2]  Seymour Ginsburg,et al.  Studies In Abstract Families Of Languages , 1969 .

[3]  Hisao Yamada,et al.  Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..

[4]  Arnold L. Rosenberg,et al.  Real-Time Definable Languages , 1967, JACM.

[5]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[6]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[7]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[8]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9]  Jeffrey D. Ullman,et al.  An Approach to a Unified Theory of Automata , 1967, SWAT.

[10]  Ben Wegbreit.  A Generator of Contex-Sensitive Languages , 1969, J. Comput. Syst. Sci..

[11]  Paul R. Young,et al.  Toward a Theory of Enumerations , 1968, JACM.

[12]  Jeffrey D. Ullman,et al.  Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[13]  Seymour Ginsburg,et al.  Principal AFL , 1970, J. Comput. Syst. Sci..

[14]  Seymour Ginsburg,et al.  Abstract Families of Languages , 1967, SWAT.

[15]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[16]  Walter J. Savitch.  Deterministic simulation of non-deterministic turing machines (Detailed Abstract) , 1969, STOC '69.

[17]  Sheila A. Greibach,et al.  Quasi-realtime languages (Extended Abstract) , 1969, STOC.