Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
- 655 Downloads
It is a well-known theorem by Chomsky and Schützenberger (1963) that every context-free language can be represented as a homomorphic image of the intersection of a Dyck language and a regular language. This paper gives a Chomsky-Schützenberger-type characterization for multiple context-free languages, which are a natural extension of context-free languages, with introducing the notion of multiple Dyck languages, which are also a generalization of Dyck languages.
KeywordsRegular Language Derivation Tree Terminal Symbol Nonterminal Symbol Start Symbol
Unable to display preview. Download preview PDF.
- 2.Engelfriet, J.: Context-free graph grammars. In: Handbook of formal languages, vol. 3, Springer, Heidelberg (1997)Google Scholar
- 3.Kaji, Y.: Universal recognition problems and a representation theorem using dyck-type languages for multiple context-free grammars. Bachelor’s thesis, Osaka University (1991)Google Scholar
- 9.Thomas, W.: Languages, automata, and logic. In: Handbook of formal languages, vol. 3. Springer, Heidelberg (1997)Google Scholar