Branching synchronization grammars with nested tables
作者：
Highlights：
•
摘要
A generalization of ET0L systems is introduced: grammars with branching synchronization and nested tables. The main result is that branching synchronization grammars with tables of nesting depth n have the same string- and tree-generating power as n-fold compositions of top-down tree transducers. Based on this it is shown, e.g., that the family of generated string languages is a full principal AFL for each n.
论文关键词：
论文评审过程：Received 28 April 2003, Revised 24 October 2003, Available online 17 January 2004.
论文官网地址：https://doi.org/10.1016/j.jcss.2003.10.001
