Spinal-formed context-free tree grammars
From MaRDI portal
Publication:1969437
DOI10.1007/s002249910004zbMath0945.68100OpenAlexW2068249429MaRDI QIDQ1969437
Publication date: 16 March 2000
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002249910004
Related Items (11)
A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser for helpful comments. ⋮ Linearity and nondeletion on monadic context-free tree grammars ⋮ Combinatory categorial grammars as generators of weighted forests ⋮ Grammatical verification for mathematical formula recognition based on context-free tree grammar ⋮ The equivalence of tree adjoining grammars and monadic linear context-free tree grammars ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ Restarting Tree Automata and Linear Context-Free Tree Languages ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Parameter Reduction in Grammar-Compressed Trees ⋮ Two Equivalent Regularizations for Tree Adjoining Grammars ⋮ Linear weighted tree automata with storage and inverse linear tree homomorphisms
This page was built for publication: Spinal-formed context-free tree grammars
