A computational model for generic graph functions

Autor: Gemis, M., Peelman, P., Paredaens, J., Van den Bussche, J., Schneider, H.J., Ehrig, H.
Přispěvatelé: Mathematics and Computer Science, VF-programme Information Systems - Computer Science
Jazyk: angličtina
Rok vydání: 1993
Předmět:
Zdroj: Dagstuhl-Seminar-Report
Graph transformations in computer science / Schneider, Hans Jürgen [edit.]
Graph Transformations in Computer Science ISBN: 9783540577874
Dagstuhl Seminar on Graph Transformations in Computer Science
Graph Transformations in Computer Science (Proceedings International Workshop, Dagstuhl Castle, Germany, January 1993), 170-188
STARTPAGE=170;ENDPAGE=188;TITLE=Graph Transformations in Computer Science (Proceedings International Workshop, Dagstuhl Castle, Germany, January 1993)
Popis: The generic graph machine, a Turing machine-like computation model for generic graph functions, is introduced. A configuration of this machine consists of a number of machine instances that each are in a state and point to two nodes of a graph. During the execution of a step, the machine instances perform in parallel a local transformation on the graph and are each replaced by a number of other machine instances. It is proved that the generic graph machines express a large and natural class of generic graph functions.
Databáze: OpenAIRE