Trips on trees

Engelfriet Joost and Hoogeboom Hendrik Jan and Van Best Jan-Pascal: Trips on trees. In: Acta cybernetica, (14) 1. pp. 51-64. (1999)

[thumbnail of cybernetica_014_numb_001_051-064.pdf]
Cikk, tanulmány, mű

Download (983kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1999
Volume: 14
Number: 1
ISSN: 0324-721X
Page Range: pp. 51-64
Language: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 63-64. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 14. 08:36

Actions (login required)

View Item View Item