Skip to main content
Log in

Universality properties of certain classes of languages

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).

    Google Scholar 

  2. S. Ginsburg and S. A. Greibach, “Abstract families of languages,” Mem. Amer. Math. Soc.,87 (1969).

  3. S. A. Greibach, “A new normal form theorem for context-free phrase-structure grammars,” J. ACM,13 (1966).

  4. A. V. Gladkii, Lectures in Mathematical Linguistics [in Russian], Izd. Novosibrsk. Gos. Univ. (1966).

  5. A. V. Aho and J. D. Ullmann, The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs (1972).

    Google Scholar 

  6. J. A. Feldman and D. Gries, “Translator writing systems,” Commun. ACM,11, 2 (1968).

    Google Scholar 

  7. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, Programming [in Russian], Naukova Dumka, Kiev (1974).

    Google Scholar 

  8. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  9. A. A. Markov, “The theory of algorithms,” Tr. Mat. Inst. Akad. Nauk SSSR,42, (1954).

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 82–88, May–June, 1976.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070023

Keywords

Navigation