Skip to main content
SpringerLink
Log in

Growth functions of some 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

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. N. Chomsky and J. Miller, “Finite state languages,” in: Kibern. Sb. No. 4, 231–255 (1962).

  2. N. Chomsky and M. Schützenberger, “An algebraic theory of context-free languages,” in: Kibern. Sb., New Series, No. 3, 195–242 (1966).

  3. S. Ginsburg, The Mathematical Theory of Contex-Free Languages McGraw-Hill, New York (1970).

    Google Scholar 

  4. S. Kuroda, “Classes of languages and linear-bounded automata,” Inf. Control,7 No. 2, 207–223 (1964).

    Google Scholar 

  5. M. Hall, Combinatorial, Theory, Blaisewell, New York (1970).

    Google Scholar 

Download references

Authors
  1. V. I. Trofimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 9–12, November–December, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trofimov, V.I. Growth functions of some classes of languages. Cybern Syst Anal 17, 727–731 (1981). https://doi.org/10.1007/BF01069218

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation