Skip to main content

Important Features of Regular and Context Free Languages

  • Chapter
  • First Online:
  • 2579 Accesses

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.95
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Notes

  1. 1.

    We omit the context sensitive (type 1) languages from this discussion. Only the ε-free CFGs are context sensitive, as context sensitive grammars are not allowed to have any ε productions.

  2. 2.

    We leave out the single ε production, if it exists, and concentrate only on the ε-free part of the grammar.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan P. Parkes .

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag London Limited

About this chapter

Cite this chapter

Parkes, A.P. (2008). Important Features of Regular and Context Free Languages. In: A Concise Introduction to Languages and Machines. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84800-121-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-121-3_6

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-120-6

  • Online ISBN: 978-1-84800-121-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics