Generalized DOL trees
Infinite unlabeled trees having a finite number of different subtrees (also called infinite regular trees) arise in a natural way from a DOL system which also gives a natural labeling for the tree. A much more compact representation for the tree often results from a DOL system with fragmentation.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1995
|
| Series: | Acta cybernetica
12 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12539 |
| Summary: | Infinite unlabeled trees having a finite number of different subtrees (also called infinite regular trees) arise in a natural way from a DOL system which also gives a natural labeling for the tree. A much more compact representation for the tree often results from a DOL system with fragmentation. |
|---|---|
| Physical Description: | 1-9 |
| ISSN: | 0324-721X |