Branching synchronization grammars with nested tables

https://doi.org/10.1016/j.jcss.2003.10.001Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)

The results of this article were presented at Developments in Language Theory 2003 [DE03].