Tree adjoining languages and multipushdown languages

DOI10.1007/S002240010004zbMATH Open0961.68075OpenAlexW2081149652WikidataQ127451765 ScholiaQ127451765MaRDI QIDQ1587367FDOQ1587367

Pierluigi San Pietro, A. Cherubini

Publication date: 7 December 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240010004

Recommendations

• scientific article; zbMATH DE number 475427
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• scientific article; zbMATH DE number 3945364
• scientific article; zbMATH DE number 475413
• Tree algebras and varieties of tree languages
• scientific article
• Multiple context-free tree grammars and multi-component tree adjoining grammars
• SEMIGROUPS OF TREE LANGUAGES
• On the topological complexity of tree languages
• scientific article; zbMATH DE number 475424

zbMATH Keywords

context-free grammers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (5)

• An NC algorithm for recognizing tree adjoining languages
• Storage products and linear control of derivations
• Spinal-formed context-free tree grammars
• On the relation between multi-depth grammars and tree adjoining grammars
• Title not available (Why is that?)

This page was built for publication: Tree adjoining languages and multipushdown languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587367)