Literature Cited
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
S. Ginsburg and S. A. Greibach, “Abstract families of languages,” Mem. Amer. Math. Soc.,87 (1969).
S. A. Greibach, “A new normal form theorem for context-free phrase-structure grammars,” J. ACM,13 (1966).
A. V. Gladkii, Lectures in Mathematical Linguistics [in Russian], Izd. Novosibrsk. Gos. Univ. (1966).
A. V. Aho and J. D. Ullmann, The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs (1972).
J. A. Feldman and D. Gries, “Translator writing systems,” Commun. ACM,11, 2 (1968).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, Programming [in Russian], Naukova Dumka, Kiev (1974).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
A. A. Markov, “The theory of algorithms,” Tr. Mat. Inst. Akad. Nauk SSSR,42, (1954).
Additional information
Translated from Kibernetika, No. 3, pp. 82–88, May–June, 1976.
Rights and permissions
About this article
Cite this article
Burgina, E.S. Universality properties of certain classes of languages. Cybern Syst Anal 12, 417–424 (1976). https://doi.org/10.1007/BF01070023
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070023