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 |
| LEADER | 01068nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12539 | ||
| 005 | 20220613132306.0 | ||
| 008 | 161015s1995 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Kari Lila | |
| 245 | 1 | 0 | |a Generalized DOL trees |h [elektronikus dokumentum] / |c Kari Lila |
| 260 | |c 1995 | ||
| 300 | |a 1-9 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 1 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Rozenberg Grzegorz |e aut |
| 700 | 0 | 1 | |a Salomaa Arto |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12539/1/cybernetica_012_numb_001_001-009.pdf |z Dokumentum-elérés |