Skip to main content
SpringerLink
Log in

Context-free and domination grammars and the algorithmic problems connected with them

  • 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

References

  1. N. Chomsky and G. A. Miller, “Introduction to the formal analysis of natural languages,” Handbook of Math. Psychology, Vol. 2, New York, Wiley, 269–322, 1963.

    Google Scholar 

  2. E. V. Paducheva, “On methods of establishing the syntactic structure of sentences,” Voprosy yazykoznaniya, no. 2, pp. 99–113, Moscow, 1964.

  3. S. Ya. Fitialov, “On the equivalence of NS grammars and grammars of dependencies,” collection: Problems of Structural Linguistics [in Russian], Moscow 1967 (in press).

  4. M. I. Beletskii, “A model for describing a system of constituents and government relations in a language,” collection: Problems of Structural Linguistics [in Russian], Moscow, 1967 (in press).

  5. M. I. Beletskii, V. M. Grigoryan, and I. D. Zaslavskii, “Axiomatic description of word order and government in some types of sentences,” collection: Mathematical Questions of Cybernetics and Computer Technology, I [in Russian], pp. 71–86, Erevan, 1963.

  6. A. V. Gladkii, Lectures on Mathematical Linguistics for Students of Novosibirsk State University [in Russian], Novosibirsk, 1966.

  7. A. A. Markov, “On some algorithms connected with systems or words,” Izvestiya AN SSSR. Seriya matematicheskaya, 27, No. 1, pp. 101–160, 1963.

    Google Scholar 

  8. A. A. Markov, “Theory of algorithms,” Trudy MI im. V. A. Steklova, 42, Moscow-Leningrad, 1954.

  9. P. S. Landweber, “Decision problems of phrase structure grammars,” IEEE Trans. on Electronic Computers, EC-13, no. 4, 354–362, 1964.

    Google Scholar 

  10. J. Bar-Hillel, Perles, and E. Shamir, “Formal properties of simple phrase structure grammars,” Zeiischr. f. Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14 no. 2, 143–172, 1961.

    Google Scholar 

  11. D. Cantor, “On the ambiguity problems of backup systems,” Journal ACM, 9, 477–479, 1962.

    Google Scholar 

  12. A. V. Gladkii, “Some algorithmic problems for context-free grammars,” Algebra i logika, vol. 4, no. 1, pp. 3–14, 1965.

    Google Scholar 

  13. A. V. Gladkii, “The algorithmic unrecognizability of the essential indeterminacy of context-free languages,” Algebra i logika, Vol. 4, no. 4, pp. 53–64, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute AS UkrSSR, USSR

    M. I. Beletskii

Authors
  1. M. I. Beletskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 3, No. 4, pp. 90–97, 1967.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beletskii, M.I. Context-free and domination grammars and the algorithmic problems connected with them. Cybern Syst Anal 3, 74–80 (1967). https://doi.org/10.1007/BF01071712

Download citation

  • Issue Date:

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

Keywords

Search

Navigation