Branching grammars: a generalization of ET0L systems

  • Authors:
  • Frank Drewes;Joost Engelfriet

  • Affiliations:
  • Department of Computing Science, Umeå University, Umeå, Sweden;Department of Computer Science, Leiden University, Leiden, The Netherlands

  • Venue:
  • DLT'03 Proceedings of the 7th international conference on Developments in language theory
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Generalizing ET0L systems, we introduce branching synchronization grammars with nested tables. 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.