Abstract
The paper attempts (i) to present descriptional complexity as an identifiable part of the theory of complexity incorporating many diverse areas of research, (ii) to formulate basic problems and to survey some results (especially those concerning languages) in descriptional complexity, (iii) to discuss relation between descriptional and computational complexity.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
BLUM, M., On the size of machines. Information and Control, 11 (1967), 257–265.
BORODIN, A., Computational Complexity: Theory and Practice. In "Currents in the Theory of Computing. Ed. A.V. Aho, Prentice-Hall, (1973), 35–89.
ČERNÝ, A., Complexity and minimality of context-free languages and grammars. University of Bratislava, (1976), 1–64.
CHAITIN, G.J., Information-theoretic limitations of formal systems. J. Assoc. Comput. Mach. 21 (1974), 403–424.
COHEN, R.S., BRZOZOWSKI, J.A., Dot-depth of star-free events. J. Comput. System Sci. 5 (1971), 1–16.
CONSTABLE, R.L., BORODIN, A.B., Subrecursive programming languages Part I: Efficiency and program structure, J. Assoc. Comput. Mach. 19 (1972), 526–568.
EHRENFEUCHT, A., ZEIGER, P., Complexity measures for regular expressions. Proc. ACM Symposium on Theory of Computing, (1974), 75–79.
FISCHER, M.J., The complexity of negation-limited networks — a brief survey Proc. 2nd GI Conference Automata Theory and Formal Languages. Lecture Notes in Computer Science 33, (1975), 71–82.
FISCHER,M.J., MEYER, A.R., PATERSON, M.S., Lower Bounds on the Size of Boolean formulas. Proc. ACM Symposium on Theory of Computing, (1975), 37–44.
FISCHER, P.C., Trends in computational complexity. In "Computational Complexity". Ed. R. Rustin, Algorithmics Press, (1973), 1–22.
GELLER, M.M., HUNT III, H.B., SZYMANSKI, T.G., ULLMAN, J.D., Economy of description by parsers, DPDA's and PDA's, Proc. Symposium on Foundations of Computer Science, (1975), 122–127.
GEWIRTZ, W.L., Investigations in the theory of descriptive complexity. RN NSO-5, Courant Institute of Mathematical Sciences, (1974), 1–60.
GINSBURG, S., LYNCH, N., Comparative complexity of grammar forms. Proc. Symposium on Theory of Computing, (1975), 153–158.
GINSBURG, S., MAURER, H.A., On strongly equivalent context-free grammar forms. Computing, 16, (1976), 281–290.
GRUSKA, J., Complexity and unambiguity of context-free grammars and languages. Information and Control, 18, (1971), 502–519.
GRUSKA, J., Generation and approximation of finite and infinite languages. Proc. MFCS'72, Warsaw, (1972), 1–7.
GRUSKA, J., Descriptional complexity of context-free languages. Proceedings of MFCS'73, High Tatras, 71–83.
GRUSKA, J., A note on ɛ-rules in context-free grammars. Kybernetika, 11, (1975), 26–31.
HARPER, L.H., NSIEH, W.N., SAVAGE, J.E., A class of Boolean functions with linear combinational complexity. Theoret. Comput. Sc. 1 (1975), 161–184.
HARRISON, M.A., HAVEL, I.M., Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.
HARTMANIS, J., HUNT III, H.B., The LBA Problem and its importance in the theory of computing. SIAM-AMS Proc. 7, (1974), 1–26.
HARTMANIS, J., SIMON, J., On the structure of feasible computations. In Advances in Computers. V 14, Academic Press, New York, 1976.
HUNT III, H.B., RANGEL, J.L., Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages. Proc. Symposium on Foundations of Computer Science, (1975), 144–150.
HUNT III, H.B., ROSENKRANTZ, D.J., Computational Parallels between the Regular and Context-free Languages. Proc. ACM Symposium on Theory of Computing. (1974), 64–74.
HUNT, III, H.B., SZYMANSKI, T.G., On the complexity of grammar and related problems. Proc. ACM Symposium on Theory of Computing, (1975), 54–65.
HUNT III, H.B., SZYMANSKI, T.G., ULLMAN, J.D., On the complexity of LR(k) testing. Proc. Conf. on Principles of Computer Languages. Palo Alto, (1975), 130–136.
LIND, J.C., Computing in Logarithmic space. MAC MEM. 52, MIT, 1974.
McCREIGHT, E.M., MEYER, A.R., Classes of computable functions defined by bounds on computation. Proc. ACM Symposium on Theory of Computing, (1969), 79–88.
MEYER, A.R., BAGCHI, A., Program size and economy of descriptions. Proc. ACM Symposium on Theory of Computing, (1972), 183–186.
MEYER, A.R., FISCHER, M.J., Economy of description by automata, grammars, and formal systems. Proc. Symposium on Switching and Automata Theory, (1971), 188–191.
MEYER, A.R., RITCHIE, D.M., The complexity of loop programs. Proc. 22nd National ACM Conference, (1967), 465–470.
MILLER, G.L., Riemann's hypothesis and tests for primality. Proc. ACM Symposium on Theory of Computing, (1975), 234–239.
MONIEN, B., Transformational methods and their application to complexity problems. Universität Hamburg, (1975), 1–16.
PIRICKÁ, A., Complexity and normal forms of context-free languages. Proc. MFCS '74. Lecture Notes in Computer Science. 28, (1975), 292–297.
PIRICKÁ, A., Greibach normal form complexity. Proc. of MFCS'75, Lecture Notes in Computer Science, 32, (1975), 344–350.
PRATT, W.R., The effect of basis on size of Boolean expressions. Proc. Symposium on Foundations of Computer Science, (1975), 119–121.
SCHMITT, A.A., The state complexity of Turing machines. Information and Control, 17, (1970), 217–225.
STOCKMEYER, L.J., The complexity of decision problems in automata theory and logic. Project MAC TR 133, 1974.
SYMES, D.M., The computation of finite functions. Proc. ACM Symposium on Theory of Computing, (1972), 177–182.
VASILIEV, Ju.L., GLAGOLEV, V.V., KOROBKOV, V.K., Metric investigations in discrete analysis. Problemy Kibernet., No 27 (1973), 63–74.
ZASLAVSKII, J.D., On some models of computability of Boolean functions. Proc. MFCS'75. Lecture Notes in Computer Science, 32, (1975), 153–159.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gruska, J. (1976). Descriptional complexity (of languages) a short survey. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_162
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_162
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive