Skip to main content
SpringerLink
Log in

Syntactic analysis of context-free (CF) languages using nondeterministic push-down automata

  • 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. D. J. Rosenkrantz, “Matrix equations and normal forms for context-free grammars,” J. ACM,14, No. 3, (1967).

  2. A. A. Letichevskii, “Representation of context-free languages in automata of the push-down type with memory,” Kibernetika, No. 2 (1965).

  3. A. J. Korenjak and J. E. Hopcroft, “Simple deterministic languages,” in: IEEE Conference Report of 1966 Seventh Annual Symposium on Switching and Automata Theory (1966).

  4. A. L. Fuksman, “Concerning certain grammars for the description of context-free languages,” in: First All-Union Conference on Programming, Series A [in Russian], Kiev, November (1968).

  5. S. Ginsburg and S. Greibach, “Deterministic context-free languages,” Inf. Control,9, No. 6 (1966).

    Google Scholar 

  6. S. Greibach, “A new normal-form theorem for context-free phrase structure grammars,” J. ACM,12, No. 1 (1965).

    Google Scholar 

  7. T. V. Griffiths and S. P. Petric, “On the relative efficiencies of context-free grammar recognizers,” Commun. ACM,8 (1965).

  8. A. Sh. Nepomnyashchaya, “Syntactic analysis in context-free languages,” in: Theory of Automata, [in Russian], No. 2, Izd. Inst. Kibernetika, Akad. Nauk Ukr. SSR, Kiev (1969).

    Google Scholar 

Download references

Authors
  1. A. Sh. Nepomnyashchaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 72–80, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nepomnyashchaya, A.S. Syntactic analysis of context-free (CF) languages using nondeterministic push-down automata. Cybern Syst Anal 10, 458–467 (1974). https://doi.org/10.1007/BF01068714

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation