Skip to main content
SpringerLink
Log in

Hierarchies of context-free languages with respect to their recognition times

  • 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. Ya. M. Barzdin', “Complexity of recognition of symmetry on Turing machines,” Probl. Kibernetika, No. 15 (1965).

  2. M. K. Valiev, “Certain estimates of computing time on Turing machines with input,” Kibernetika, No. 6 (1970).

  3. M. K. Valiev and A. Ya. Dikovskii, “Hierarchies of context-free languages with respect to their recognition times,” in: Structural-Mathematical Methods for the Simulation of Languages, Theses of Reports and Communications of an All-Union Scientific Conference [in Russian], Part 1, Kiev (1970).

  4. A. V. Gladkii, “Certain algorithmic problems for context-free grammars,” Algebra i Logika,4, No. 1 (1965).

    Google Scholar 

  5. B. A. Trakhtenbrot, “Turing computations with logarithmic delay,” Algebra i Logika,3, No. 5, Novosibirsk (1964).

  6. R. V. Freivald, “On the order of growth of exact time signalizers for Turing calculations,” Algebra i Logika,5, No. 5 (1966).

    Google Scholar 

  7. R. V. Freivald, ldThe complexity of recognition of symmetry on Turing machines with input,” Algebra i Logika,4, No. 1 (1965).

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

    Google Scholar 

  9. J. Hartmanis, “Computational complexity of one-tape Turing machine computation,” J. ACM,15, No. 2 (1968).

    Google Scholar 

  10. F. C. Hennie, “One-tape off-line Turing machine computations,” Inf. Control,8, No. 6 (1965).

    Google Scholar 

  11. T. Kasami, “A note on computing time for recognition of languages generated by linear grammars,” Inf. Control,10, No. 2 (1967).

    Google Scholar 

  12. P. M. Lewis II, R. E. Stearns, and J. Hartmanis, “Memory bounds for recognition of context-free and context-sensitive languages,” in: IEEE Conference Rec. Switch Circuit Theory and Logic Design, New York (1965).

  13. R. E. Stearns, J. Hartmanis, and P. M. Lewis II, “Hierarchies of memory limited computations,” in: IEEE Conference Rec. Switch. Circuit Theory and Logic Design, New York (1965).

  14. P. Strand, “On-line Turing machine recognition,” Inf. Control,12, Nos. 5, 6 (1968).

    Google Scholar 

Download references

Authors
  1. M. K. Valiev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ya. Dikovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Results weaker than those obtained in the present paper were announced by us in [3].

Translated from Kibernetika, No. 3, pp. 11–16, May–June, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Valiev, M.K., Dikovskii, A.Y. Hierarchies of context-free languages with respect to their recognition times. Cybern Syst Anal 11, 355–361 (1975). https://doi.org/10.1007/BF01069458

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation