The Chomsky—Schützenberger Theorem

  • Dexter C. Kozen
Part of the Undergraduate Texts in Computer Science book series (UTCS)


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 $$


Normal Form Induction Hypothesis Distinct Type Algorithm Analysis Homomorphic Image 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1977

Authors and Affiliations

  • Dexter C. Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations