Skip to main content
SpringerLink
Log in
Book cover

Automata and Computability pp 198–200Cite as

The Chomsky—Schützenberger Theorem

  • Chapter

Part of the book series: Undergraduate Texts in Computer Science ((UTCS))

Abstract

Let PAREN n denote the language consisting of all balanced strings of parentheses of n distinct types. This language is generated by the grammar

$$ \S \to \mathop {[S}\limits_1 \mathop ]\limits_1 \left| {\mathop {[S}\limits_2 \mathop ]\limits_2 } \right|...\left| {\mathop {[S}\limits_n \mathop ]\limits_n } \right|\left. {SS} \right| \in $$

.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853-7501, Ithaca, NY, USA

    Dexter C. Kozen

Authors
  1. Dexter C. Kozen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kozen, D.C. (1977). The Chomsky—Schützenberger Theorem. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85706-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85708-9

  • Online ISBN: 978-3-642-85706-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation