AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to extend grammatical codes of trees to node-labeled trees, and the case of binary trees (forests) is studied
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
AbstractGrammatical codes of trees provide a way to encode ordered trees into strings over a finite ...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
The paper introduces two new concepts, namely C-grammar and tree-codification, based on the theory o...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
AbstractGrammatical codes of trees provide a way to encode ordered trees into strings over a finite ...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
The paper introduces two new concepts, namely C-grammar and tree-codification, based on the theory o...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and sta...
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
DOI
Add to ORKG