A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
[chapter]
2014
Lecture Notes in Computer Science
I define a generalization of linear indexed grammars that is equivalent to simple context-free tree grammars in the same way that linear indexed grammars are equivalent to tree-adjoining grammars.
doi:10.1007/978-3-662-44121-3_6
fatcat:6cl6a7dscnhnjktffgsibmwn5i