Context-free tree grammars are as powerful as context-free jungle grammars

DOI10.14232/ACTACYB.22.2.2015.9zbMATH Open1349.68104OpenAlexW1774742019MaRDI QIDQ2803053FDOQ2803053

Authors: Frank Drewes, Joost Engelfriet 

Publication date: 3 May 2016

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.22.2.2015.9

Recommendations

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Fuzzy context-free tree grammars
• Non-self-embedding linear context-free tree grammars generate regular tree languages
• Context-free grammars on trees
• Bag context tree grammars

zbMATH Keywords

context-free tree grammardelegation networkjungle

Mathematics Subject Classification ID

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

This page was built for publication: Context-free tree grammars are as powerful as context-free jungle grammars

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