Skip to main content

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

  • 583 Accesses

Abstract

Context-free grammars and languages play an important role in Linguistics and Computer Science. Introduced by Noam Chomsky in 1958 as tools for the description of natural language, it was soon realized that they also could be used for the design of programming languages. They are still in the core of descriptions, both in Linguistics and Computer Science. The chapter is subdivided into sections on basic definitions, normal forms, structural properties, closure properties, decision problems, and algebraic characterization. For further information on basic notations, especially from mathematics, the reader is referred to the textbooks listed in the references. There a more detailed bibliography can be found, too. Also many of the theorems and proofs, often in variant form, are to be found there. The proofs presented here are rather informal.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel. Transductions and Context-free Languages. Teubner Studienbücher, Stuttgart, 1979.

    MATH  Google Scholar 

  2. P. Dömösi, M. Kudlek. Strong Iteration Lemmata for Regular, Linear, Context-free, and Linear Indexed Languages. In: Proceedings FCT’1999, LNCS 1684, 226–233, 1999.

    Google Scholar 

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

    Google Scholar 

  4. J.E. Hoperoft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  5. W. Kuich, A. Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science Vol. 5, Springer-Verlag, 1986.

    Google Scholar 

  6. A. Salomaa Formal Languages. Academic Press, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kudlek, M. (2004). Context-Free Languages. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics