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

DOI10.1007/s10849-011-9134-0zbMath1274.68151OpenAlexW2049167443MaRDI QIDQ438589

Stephan Kepser, Jim Rogers

Publication date: 31 July 2012

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-011-9134-0

zbMATH Keywords

monadic second-order logictree adjoining grammartree languagemodel-theoretic syntaxmonadic linear context-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Model theory of finite structures (03C13) Linguistics (91F20)

Related Items (7)

Combinatory categorial grammars as generators of weighted forests ⋮ The generative power of delegation networks ⋮ Regular Approximation of Weighted Linear Context-Free Tree Languages ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ The tree-generative capacity of combinatory categorial grammars ⋮ Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Linearity and nondeletion on monadic context-free tree grammars
• Tree adjunct grammars
• IO and OI. I
• wMSO theories as grammar formalisms
• Spinal-formed context-free tree grammars
• Closure properties of linear context-free tree languages with an application to optimality theory

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