scientific article; zbMATH DE number 1504824

zbMATH Open0956.68074MaRDI QIDQ4502802FDOQ4502802

Authors: Sebastian Maneth, Joost Engelfriet 

Publication date: 7 November 2000

Title of this publication is not available (Why is that?)

Recommendations

• A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
• scientific article; zbMATH DE number 1361481
• scientific article; zbMATH DE number 1456950
• Regular description of context-free graph languages
• scientific article; zbMATH DE number 4060748

zbMATH Keywords

tree languages

Mathematics Subject Classification ID

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

Cited In (16)

• Title not available (Why is that?)
• Constructing small tree grammars and small circuits for formulas
• Second-order abstract categorial grammars as hyperedge replacement grammars
• An operational and denotational approach to non-context-freeness
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Multiple context-free tree grammars: lexicalization and characterization
• Title not available (Why is that?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Bag context tree grammars
• Tree generating context-free grammars and regular tree grammars are equivalent
• Tree-based generation of languages of fractals
• The generative power of delegation networks
• Tree-Based Generation of Restricted Graph Languages
• Multi-Component Tree Insertion Grammars
• Context-free grammars on trees
• On context-free trees

This page was built for publication:

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