1. A. Borodin. On relating time and space to size and depth. SIAM J. COMPUT., 6 (4): 733–744, December 1977.
2. A. Bertoni, G. Mauri, and N. Sabadini. A characterization of the class of functions computable in polynomial time on random access machines. In Proc. 13th Annual ACM Symposium on Theory of computing, pages 168–176, May 1981.
3. A. Meyer and M. Fischer. Economy of description by automata, grammars and formal systems. In Conference Record, IEEE 12th Annual Symposium on Switching and Automata Theory, pages 188–190, 1971.
4. E. Schmidt and T. Szymanski. Succinctness of descriptions of unambiguous context-free languages. SIAM J. Comput., 6: 547–553, 1977.
5. J. Hartmanis and H. Shank. On the recognition of primes by automata. JACM, 15 (3): 382–389, July 1968.