Skip to main content
SpringerLink
Log in

A note on undecidable properties of formal languages

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A general set of conditions is given under which a property is undecidable for a family of languages. Examples are given of the application of this result to wellknown families of languages.

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

Similar content being viewed by others

References

  1. Y. Bar-Hillel, M. Perles andE. Shamir, On formal properties of simple phrase structure grammars.Z. Phonetik Sprachwiss. Kommunikat. 14 (1961), 143–172.

    Google Scholar 

  2. S. Ginsburg,The Mathematical Theory of Context-Free Languages. McGraw-Hill Book Company, New York, 1966.

    Google Scholar 

  3. S. Ginsburg andS. Greibach, Deterministic context-free languages.Information and Control 9 (1966), 620–648.

    Google Scholar 

  4. S. Ginsburg andS. Greibach, Abstract families of languages. SDC Document TM-738/031/00, April 1967.

  5. S. Ginsburg, S. Greibach andM. Harrison, One-way stack automata.J. Assoc. Comput. Mach. 14 (1967), 389–418.

    Google Scholar 

  6. S. Ginsburg andE. H. Spanier, Bounded ALGOL-like languages.Trans. Amer. Math. Soc. 113 (1964), 333–368.

    Google Scholar 

  7. S. Ginsburg andJ. S. Ullian, Ambiguity in context-free languages.J. Assoc. Comput. Mach. 13 (1966), 62–89.

    Google Scholar 

  8. S. Greibach, The unsolvability of the recognition of linear context-free languages.J. Assoc. Comput. Mach. 13 (1966), 582–587.

    Google Scholar 

  9. J. Hopcroft andJ. Ullman, An approach to a unified theory of automata. (To appear inBell System Tech. J.)

  10. S. Rabin andD. Scott, Finite automata and their decision problems.IBM J. Res. Develop. 3 (1959), 114–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Harvard University, USA

    Sheila Greibach (Consultant)

  2. System Development Corporation, USA

    Sheila Greibach (Consultant)

Authors
  1. Sheila Greibach
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research sponsored in part by the Air Force cambridge Research Laboratories, Office of Aerospace Research, USAF, under Contract F1962867C0008, and by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF under Grant No. AF-AFOSR-1203-67.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Greibach, S. A note on undecidable properties of formal languages. Math. Systems Theory 2, 1–6 (1968). https://doi.org/10.1007/BF01691341

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation