Trips on trees
Year: 1999
Type: article
Abstract: . 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. 1 Introduction A specification of a function describes the result of the function in terms of its argument. The goal of the programmer is to implement this specification by a program that, for a given argument as input, produces the function result as output. From an elementary point of view, the program can be seen as a device that walks on a graph g. The nodes of g are the possible contents of the program variables, and there is an edge from node m to node n if m can be transformed into n by an atomic programming statement, such as an assignment. The p...
Source: Acta Cybernetica
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W1571327583
