A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars

DOI10.1007/978-3-662-44121-3_6MaRDI QIDQ2921946zbMATH OpenOpenAlexFDO

Authors Makoto Kanazawa

Publication date 14 October 2014

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44121-3_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited in

(7)

• A note on the equivalence and complexity of linear grammars
• An LMS-based grammar self-index with local consistency properties
• The partial clone of linear tree languages
• scientific article; zbMATH DE number 3870623 (Why is no real title available?)
• scientific article; zbMATH DE number 3483585 (Why is no real title available?)
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Derived linear systems of context-free grammars

This page was built for publication: A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars

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