[1] J. Hartmanis P. M. Lewis II R. E. Stearns: Classifications of computations by time and memory requirements. IFIP Congress in New York, 1965.

[2] H. Yamada: Counting by a class of growing automata. PhD Thesis, Moore School of Elect. Eng., University of Pennsylvania (1960).

[3] H. Yamada: Real-time computation and recursive functions not real time computable. IRE Trans. on Electronic Computers, EC-11 (1960). MR 0152161

[4] P. C. Fischer A. R. Meyer A. L. Rosenberg: Time-restricted sequences generation. Journal of Computer and System Sciences 4, (1970) 50-73. MR 0253594

[5] M. Nekvinda: On the complexity of events recognizable in real time. Kybernetika 9, (1973), 1, 1-10. MR 0329320 | Zbl 0264.94039

[6] M. Nekvinda: On the complexity of countable functions. Proceedings of Symposium and Summer School on Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia, 1973. MR 0403314