1. Ronald V. Book and Sheila A. Greibach. Quasi-realtime languages. Mathematical Systems Theory, 4:97–111, 1970.
2. Franz-Josef Brandenburg. Multiple equality sets and Post machines. Journal of Computer and System Sciences, 21:292–316, 1980.
3. D. Yu. Grigor'ev. Imbedding theorems for Turing machines of different dimensions and Kolmogorov's algorithms. Dokl. Akad. Nauk SSSR, 234:15–18, 1977. In Russian, translation in Soviet Math. Dokl., 18:588–592, 1977.
4. D. Yu. Grigor'ev. Time complexity of multidimensional Turing machines. Zapiski Nauchnykh Seminarov Leningradskogo Otdelniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, 88:47–55, 1979. In Russian, translation in J. Soviet Mathematics, 20:2290–2295, 1982.
5. Juris Hartmanis and Richard E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117:285–306, 1965.