Tree adjoining languages and multipushdown languages

DOI10.1007/S002240010004MaRDI QIDQ1587367zbMATHOpenAlexWikidataFDO

Authors A. Cherubini, Pierluigi San Pietro

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

zbMATH Keywords

context-free grammers

Mathematics Subject Classification ID

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

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; zbMATH DE number 54244
• 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

Cited in

(5)

• On the relation between multi-depth grammars and tree adjoining grammars
• Spinal-formed context-free tree grammars
• An NC algorithm for recognizing tree adjoining languages
• scientific article; zbMATH DE number 3880129 (Why is no real title available?)
• Storage products and linear control of derivations

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)