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.
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
1995
|
Sorozat: | Acta cybernetica
12 No. 1 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12539 |
Tartalmi kivonat: | 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. |
---|---|
Terjedelem/Fizikai jellemzők: | 1-9 |
ISSN: | 0324-721X |