The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

DOI10.1007/978-3-642-14322-9_11zbMATH Open1286.68287OpenAlexW3209574067MaRDI QIDQ3585002FDOQ3585002

Authors:

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14322-9_11

Recommendations

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• The equivalence of four extensions of context-free grammars
• Linearity and nondeletion on monadic context-free tree grammars
• scientific article; zbMATH DE number 475427
• Monotonic C-command: A new perspective on tree adjoining grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• The equivalence of four extensions of context-free grammars
• Title not available (Why is that?)
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Linearity and nondeletion on monadic context-free tree grammars
• A model theoretic description of tree adjoining grammars
• Linear weighted tree automata with storage and inverse linear tree homomorphisms
• On the relation between multi-depth grammars and tree adjoining grammars
• Monotonic C-command: A new perspective on tree adjoining grammar
• Two Equivalent Regularizations for Tree Adjoining Grammars

This page was built for publication: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

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