AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree t equals the number of leaves of t is investigated. The notion of an insertive strict code is introduced and investigated—these are codes of a grammatical nature. It is shown that there are exactly 120 insertive strict codes. A characterization of these codes (and their various subclasses) is given in grammatical terms
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
Constrained grammatical system have been the object of study in computational linguistics over the l...
This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractGrammatical codes of trees provide a way to encode ordered trees into strings over a finite ...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
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...
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...
Constrained grammatical system have been the object of study in computational linguistics over the l...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
Constrained grammatical system have been the object of study in computational linguistics over the l...
This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees...
AbstractThe problem of coding (chain free) trees by words where the length of the word coding a tree...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
AbstractGrammatical codes of trees provide a way to encode ordered trees into strings over a finite ...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractThe objective of this paper is to study, by new formal methods, the notion of tree code intr...
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...
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...
Constrained grammatical system have been the object of study in computational linguistics over the l...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
Constrained grammatical system have been the object of study in computational linguistics over the l...
This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees...
DOI
Add to ORKG