U.: Closure properties of linear context-free tree languages with an application to optimality theory - Kepser, Mo虉nnich - 2006 () Citation Context ... captured by well-nested multiple context-free grammars [13],2 coupled-context-free grammars [10], nonduplicating macro grammars [25], ...
All the mentioned closure properties are summarized in Table 1. These results are compared to the (mostly) well-known properties of ordinary context-free grammars and their subfamilies. Discussing the closure properties of the latter is beyond the scope of this survey. The references to the liter...
Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science, 354(1):82-97. doi:10.1016/j.tcs.2005.11.024. Cited on page 48.Kepser, Stephan, and Uwe Monnich. 2006. Closure properties of linear context-free tree languages with...
relativized closure propertiesnest setcontext-free grammarpaired terminal symbolsnonterminal symbolsrecognizable setsbinary treesA nest set is the language generated by a context-free grammar whose rules are A → aB a C or A → (where a, ā are paired terminal symbols, and A, B, C are ...