Skip to main content
SpringerLink
Log in

There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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. A. L. Semenov, “Algorithmic problems for power series and context-free grammars,” Dokl. Akad. Nauk SSSR,212, No. 1, 50–52 (1973).

    Google Scholar 

  2. An. A. Muchnik, “Application of Semenov's method to the analysis of the structure of context-free languages,” in: Semiotic Aspects of Formalization of Mental Activity [in Russian], VINITI, Moscow (1985), pp. 212–214.

    Google Scholar 

  3. J. E. Hopcroft, “On the equivalence and containment problems for context-free languages,” Math. Syst. Theor.,3, No. 2, 119–124 (1969).

    Google Scholar 

  4. W. Brauer, Introduction to the Theory of Finite Automata [Russian translation], Radio i Svyaz', Moscow (1987).

    Google Scholar 

  5. H. Lalleman, Semigroups and Combinatorial Applications [Russian translation], Mir, Moscow (1985).

    Google Scholar 

  6. A. V. Gladkii, “The essential indeterminacy of context-free languages is not algorithmically recognizable,” Algebra Logika,4, No. 4, 53–64 (1965).

    Google Scholar 

  7. K. Culik and J. Karhumäki, “The equivalence of finite-valued transducers (on HDTOL languages) is decidable,” Theor. Comput. Sci.,47, 71–84 (1986).

    Google Scholar 

  8. E. Gurari and O. Ibarra, “A note on finite-valued and finitely ambiguous transducers,” Math. Systems Theory,16, 61–66 (1983).

    Google Scholar 

  9. A. Weber, “A decomposition theorem for finite valued transducers and application to the equivalence problem,” unpub. ms. (1987).

Download references

Author information

Authors and Affiliations

  1. Moscow State University, USSR

    K. Yu. Gorbunov

Authors
  1. K. Yu. Gorbunov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 50, No. 1, pp. 34–40, July, 1991.

I would like to express my appreciation to An. A. Muchnik and N. K. Vereshchagin for the statement of the problem and for useful discussion.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gorbunov, K.Y. There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages. Mathematical Notes of the Academy of Sciences of the USSR 50, 683–687 (1991). https://doi.org/10.1007/BF01156601

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation