Skip to main content
SpringerLink
Log in

On context-free and Szilard languages

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Szilard languages of context-free grammars are studied. Especially, classical pumping, generalized pumping, Sokolowski's criterion, and semilinearity are considered as possible distinguishing properties between context-free and Szilard 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. C. Bader and A. Moura,A generalization of Ogden's lemma, J. ACM 29 (1982), 404–407.

    Google Scholar 

  2. M. Blattner and M. Latteux,Parikh-bounded languages, in:Lecture Notes in Computer Science 115, pp. 316–323, Springer-Verlag, (1982).

  3. M. A. Harrison,Introduction to Formal Language Theory, Addison-Wesley, (1978).

  4. M. Höpner,Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Bericht Nr. 12, Institut für Informatik, Universität Hamburg, (1974).

  5. S. Horvath,The family of languages satisfying Bar-Hillel's lemma, RAIRO Inf. Theor. 12 (1978), 193–199.

    Google Scholar 

  6. T. Kløve,Pumping languages, Intern. J. Computer Math. 6 (1977), 115–125.

    Google Scholar 

  7. E. Moriya,Associate languages and derivational complexity of formal grammars and languages, Inform. Control 22 (1973), 139–162.

    Google Scholar 

  8. A. Nijholt,A note on the sufficiency of Sokolowski's criterion for context-free languages, Inform. Process. Lett. 14 (1982), 207.

    Google Scholar 

  9. W. Ogden,A helpful result for proving inherent ambiguity, Math. Systems Theory 2 (1968), 191–194.

    Google Scholar 

  10. R. J. Parikh,On context-free languages, J. ACM 13 (1966), 570–581.

    Google Scholar 

  11. M. Penttonen,On derivation languages corresponding to context-free grammars, Acta Inform. 3 (1973), 285–291.

    Google Scholar 

  12. S. Sokolowski,A method for proving programming languages non context-free, Inform. Process. Lett. 7 (1978), 151–153.

    Google Scholar 

  13. D. S. Wise,A strong pumping lemma for context-free languages, Theoret. Comput. Sci. 3 (1976) 359–369.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Computer Science, University of Tampere, P.O. Box 607, SF-33101, Tampere 10, Finland

    Erkki Mäkinen

Authors
  1. Erkki Mäkinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Academy of Finland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mäkinen, E. On context-free and Szilard languages. BIT 24, 164–170 (1984). https://doi.org/10.1007/BF01937483

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Categories and Subject Descriptors

General Terms

Additional Keywords and Phrases

Search

Navigation