We introduce bag context, a device for regulated rewriting in tree grammars. Rather than being part of the developing tree, bag context (bc) evolves on its own during a derivation. We show that the class of bc tree languages is the closure of the class of random context tree languages under linear top-down tree transductions. Further, an interchange theorem for subtrees of dense trees in bc tree languages is established. This result implies that the class of bc tree languages is incomparable with the class of branching synchronization tree languages
Tree-Adjoining Grammars and Lexicalized Grammars In this paper, we will describe a tree generating s...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
We introduce bag context, a device for regulated rewriting in tree grammars. Rather than being part ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
Constrained grammatical system have been the object of study in computational linguistics over the l...
Context-free tree languages play an important role in algebraic semantics and are applied in mathema...
AbstractWe consider the yield languages of synchronized tree automata, called the synchronized conte...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Summary. The continuation of the sequence of articles on trees (see [2], [3], [4], [5]) and on conte...
Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free ...
We investigate the learnability of certain subclasses of tree adjoining grammars (TAGs). TAGs are ba...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
Tree-Adjoining Grammars and Lexicalized Grammars In this paper, we will describe a tree generating s...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
We introduce bag context, a device for regulated rewriting in tree grammars. Rather than being part ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
Constrained grammatical system have been the object of study in computational linguistics over the l...
Context-free tree languages play an important role in algebraic semantics and are applied in mathema...
AbstractWe consider the yield languages of synchronized tree automata, called the synchronized conte...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Summary. The continuation of the sequence of articles on trees (see [2], [3], [4], [5]) and on conte...
Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free ...
We investigate the learnability of certain subclasses of tree adjoining grammars (TAGs). TAGs are ba...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
Tree-Adjoining Grammars and Lexicalized Grammars In this paper, we will describe a tree generating s...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...