Skip to main content
SpringerLink
Log in

Subclasses of deterministic context-free 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. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill (1966).

  2. A. A. Letichevskii, “Representation of context-free languages in push-down store machines,” Kibernetika, No. 2 (1965).

  3. R. J. Evey, The Theory and Application of Push-Down Store Machines, Doctoral Thesis, Harvard University (1963).

  4. S. Ginsburg and S. A. Greibach “Deterministic context-free languages,” Information and Control, No. 9, 620–648 (1966).

    Google Scholar 

  5. S. A. Greibach, “A new normal-form theorem for context-free phrase structure grammars,” J. Assoc. for Computing Machinery,12, No. 1, 42–52 (1965).

    Google Scholar 

  6. A. Rosenberg, “Languages defined in real time,” in: Problems of Mathematical Logic [Russian translation], Mir, Moscow (1970).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 64–67, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Subclasses of deterministic context-free languages. Cybern Syst Anal 9, 617–620 (1973). https://doi.org/10.1007/BF01068585

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation