We introduce a generalization of tree-based generators called delegation networks. These make it possible to generate objects such as strings, trees, graphs, and pictures in a modular way by combining tree-based generators of several types. Our main result states that, if all underlying tree generators generate regular tree languages (or finite tree languages), then the tree-generating power of delegation networks is the same as that of context-free tree grammars working in IO mode
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
Distributed tree processing devices, like regular tree grammars, top-down tree automata and transduc...
Tree languages are powerful tools for the representation and schematization of infinite sets of term...
We introduce a generalization of tree-based generators called delegation networks. These make it pos...
A device that generates trees over a ranked alphabet ∑, together with an interpretation of the symbo...
A device that generates trees over a ranked alphabet ∑, together with an interpretation of the symbo...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
AbstractAttributed tree transducers are abstract models used to study properties of attribute gramma...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
Abstract. String-token Petri net was introduced by labeling the tokens as strings over an alphabet. ...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstr...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
Distributed tree processing devices, like regular tree grammars, top-down tree automata and transduc...
Tree languages are powerful tools for the representation and schematization of infinite sets of term...
We introduce a generalization of tree-based generators called delegation networks. These make it pos...
A device that generates trees over a ranked alphabet ∑, together with an interpretation of the symbo...
A device that generates trees over a ranked alphabet ∑, together with an interpretation of the symbo...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
AbstractAttributed tree transducers are abstract models used to study properties of attribute gramma...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
Abstract. String-token Petri net was introduced by labeling the tokens as strings over an alphabet. ...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstr...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
Distributed tree processing devices, like regular tree grammars, top-down tree automata and transduc...
Tree languages are powerful tools for the representation and schematization of infinite sets of term...