Pages that link to "Item:Q1969437"
From MaRDI portal
The following pages link to Spinal-formed context-free tree grammars (Q1969437):
Displayed 8 items.
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars (Q438589) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Grammatical verification for mathematical formula recognition based on context-free tree grammar (Q626924) (← links)
- Linearity and nondeletion on monadic context-free tree grammars (Q835003) (← links)
- Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- Two Equivalent Regularizations for Tree Adjoining Grammars (Q3618604) (← links)
- 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 (Q4923565) (← links)