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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Engelfriet Joost
Hoogeboom Hendrik Jan
Van Best Jan-Pascal
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
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:51-64
ISSN:0324-721X