Expressiveness and complexity of generic graph machines

M. Gemis, J. Paredaens, P. Peelman, J. Van den Bussche

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

The Generic Graph Machine (GGM) model is a Turing machine-like model for expressing generic computations working directly on graph structures. In this paper we present a number of observations concerning the expressiveness and complexity of GGMs. Our results comprise the following: (i) an intrinsic characterization of the pairs of graphs that are an input—output pair of some GGM; (ii) a comparison between GGM complexity and TM complexity; and (iii) a detailed discussion on the connections between the GGM model and other generic computation models considered in the literature, in particular the generic complexity classes of Abiteboul and Vianu, and the Database Method Schemes of Denninghoff and Vianu.
Original languageEnglish
Pages (from-to)231-249
Number of pages19
JournalTheory of Computing Systems
Volume31
Issue number3
DOIs
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'Expressiveness and complexity of generic graph machines'. Together they form a unique fingerprint.

Cite this