About the Derivation Languages of Grammars and Machines

3. For each nondeterministie successor RAM (we define this machine in such a way that it can guess in one step the content of an arbitrary register) the derivation language is contained in TIME (n • log n) and its complement in NTIME (~ . Especially for the time complexity classes NRAM (..) defined by this machine and for the time complexity classes Nk DIM (..) defined by nondeterministic k-dimensional Turing machines the following holds:

[1]  Oscar H. Ibarra,et al.  Two-Way Pushdown Automata , 1967, Inf. Control..

[2]  Burkhard Monien.  Characterizations of Time-Bounded Computations by Limited Primitive Recursion , 1974 .

[3]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Y. IGARASHI.  The Tape Complexity of Some Classes of Szilard Languages , 1977, SIAM J. Comput..

[6]  Leslie G. Valiant,et al.  On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).