Results

**1 - 5**of**5**### Branching Grammars: A Generalization of ET0L Systems

, 2003

"... 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 treegenerating power as n-fold compositions of top-down tree transducers. ..."

Abstract
- Add to MetaCart

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 treegenerating power as n-fold compositions of top-down tree transducers.

### Branching Synchronization Grammars with Nested Tables

, 2002

"... A generalization of ET0L systems is introduced: grammars with branching synchronization and 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. ..."

Abstract
- Add to MetaCart

A generalization of ET0L systems is introduced: grammars with branching synchronization and 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.

### Branching Tree Grammars in TREEBAG

, 2006

"... ii In this master thesis project a class of tree grammars called “Branching tree grammar ” has been implemented into the TREEBAG system. A tree grammar is a device that generates a language of mathematical trees, according to rules specified by the user. These trees can then be transformed into for ..."

Abstract
- Add to MetaCart

ii In this master thesis project a class of tree grammars called “Branching tree grammar ” has been implemented into the TREEBAG system. A tree grammar is a device that generates a language of mathematical trees, according to rules specified by the user. These trees can then be transformed into for example pictures, by other components in TREE-BAG. The branching tree grammar, which is a class of grammars known from literature, can generate more advanced languages than the grammars previously implemented in TREEBAG. The implementation uses an approach of analyzing the branching tree grammar, and replacing it with a series of simpler components, namely regular tree grammars and top-down tree transducers. These components, when used together in a sequence transforming each others ’ output, will generate exactly the same language as the specified branching tree grammar.

### Incomparability Results for Classes of Polynomial Tree Series Transformations

, 2003

"... We consider (subclasses of) polynomial bottom-up and top-down tree series transducers over a partially ordered semiring A = (A, ⊕, ⊙, 0, 1, ≼), and we compare the classes of tree-to-tree-series and o-tree-to-tree-series transformations computed by such transducers. Our main result states the followi ..."

Abstract
- Add to MetaCart

We consider (subclasses of) polynomial bottom-up and top-down tree series transducers over a partially ordered semiring A = (A, ⊕, ⊙, 0, 1, ≼), and we compare the classes of tree-to-tree-series and o-tree-to-tree-series transformations computed by such transducers. Our main result states the following. If, for some a ∈ A with 1 ≼ a, the semiring A is a weak a-growth semiring and either (i) the semiring A is additively idempotent and x, y ∈ {polynomial, deterministic, total, deterministic and total, homomorphism}, or (ii) 1 ≺ 1 ⊕ 1 and x, y ∈ {deterministic, deterministic and total, homomorphism}, then the statements x BOT(A) ⋊ ⋉ y BOT o (A) and x BOT(A) ⋊ ⋉ y TOP(A) hold. Therein x BOT mod (A) for mod ∈ {ε, o} denotes the class of mod-tree-to-tree-series transformations computed by bottom-up tree series transducers, which have property x, over the semiring A (the class y TOP(A) is de ned similarly for top-down tree series transducers). Besides, ⋊ ⋉ denotes incomparability with respect to set inclusion.

### The TREEBAG Manual – Version 1.62 –

"... Java that allows to generate and transform objects using tree grammars and tree transducers. The basic ideas underlying Treebag are briefly summarised in Section 1. In Section 2 the Treebag worksheet—the main window of the system—is described. Section 3 explains the syntax of files needed to define ..."

Abstract
- Add to MetaCart

Java that allows to generate and transform objects using tree grammars and tree transducers. The basic ideas underlying Treebag are briefly summarised in Section 1. In Section 2 the Treebag worksheet—the main window of the system—is described. Section 3 explains the syntax of files needed to define worksheet configurations and Treebag components. In Section 4 the currently implemented classes of Treebag components are described in detail. Most parts of Treebag have been implemented using the Java Standard Environments 1.3 and 1.4, but some of the newer extensions use version 1.5. Therefore, you should not use an older version of Java. The latest Treebag version is always available at