Linearity and nondeletion on monadic context-free tree grammars

DOI10.1016/j.ipl.2004.10.008zbMath1173.68551OpenAlexW2071328460MaRDI QIDQ835003

Akio Fujiyoshi

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.008

zbMATH Keywords

tree adjoining grammarformal languagescontext-free tree grammar

Mathematics Subject Classification ID

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

Related Items (2)

The equivalence of tree adjoining grammars and monadic linear context-free tree grammars ⋮ Restarting Tree Automata and Linear Context-Free Tree Languages

Cites Work

• Unnamed Item
• Tree adjunct grammars
• TAL recognition in \(O(M(n^2))\) time
• Spinal-formed context-free tree grammars
• The equivalence of four extensions of context-free grammars
• Tree-Adjoining Language Parsing in $O(n^6 )$ Time
• Tree generating regular systems
• Mappings and grammars on trees

This page was built for publication: Linearity and nondeletion on monadic context-free tree grammars