Trips on trees
A "trip" is a triple (g,u,v) where g is, in general, a graph and u and v are nodes of that graph. The trip is from u to v on the graph g. For the special case that g is a tree (or even a string) we investigate ways of specifying and implementing sets of trips. The main result is that a reg...
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
1999
|
Sorozat: | Acta cybernetica
14 No. 1 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12609 |
LEADER | 01217nab a2200241 i 4500 | ||
---|---|---|---|
001 | acta12609 | ||
005 | 20220614083619.0 | ||
008 | 161015s1999 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 Engelfriet Joost | |
245 | 1 | 0 | |a Trips on trees |h [elektronikus dokumentum] / |c Engelfriet Joost |
260 | |c 1999 | ||
300 | |a 51-64 | ||
490 | 0 | |a Acta cybernetica |v 14 No. 1 | |
520 | 3 | |a A "trip" is a triple (g,u,v) where g is, in general, a graph and u and v are nodes of that graph. The trip is from u to v on the graph g. For the special case that g is a tree (or even a string) we investigate ways of specifying and implementing sets of trips. The main result is that a regular set of trips, specified as a regular tree language, can be implemented by a tree-walking automaton that uses marbles and one pebble. | |
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 Hoogeboom Hendrik Jan |e aut |
700 | 0 | 2 | |a Van Best Jan-Pascal |e aut |
856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12609/1/cybernetica_014_numb_001_051-064.pdf |z Dokumentum-elérés |