1. BLUM, M., On the size of machines. Information and Control, 11 (1967), 257–265.
2. BORODIN, A., Computational Complexity: Theory and Practice. In "Currents in the Theory of Computing. Ed. A.V. Aho, Prentice-Hall, (1973), 35–89.
3. ČERNÝ, A., Complexity and minimality of context-free languages and grammars. University of Bratislava, (1976), 1–64.
4. CHAITIN, G.J., Information-theoretic limitations of formal systems. J. Assoc. Comput. Mach. 21 (1974), 403–424.
5. COHEN, R.S., BRZOZOWSKI, J.A., Dot-depth of star-free events. J. Comput. System Sci. 5 (1971), 1–16.