Computational completeness of programming languages based on graph transformation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2030, Issue , 2001, Pages 230-245

  Habel, Annegret ^a   Plump, Detlef ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

TURING MACHINES;

ARBITRARY GRAPHS; COMPUTATIONAL COMPLETENESS; GRAPH TRANSFORMATION; GRAPH TRANSFORMATION RULES; PARTIAL FUNCTIONS; SEQUENTIAL COMPOSITIONS;

GRAPH THEORY;

EID: 84945253209     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_15     Document Type: Conference Paper

References (10)

1. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Proc. Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, 1-69. Springer- Verlag, 1979.
2. Claudia Ermel, Michael Rudolf, and Gabi Taentzer. The AGG approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 14, 551-603. World Scientific, 1999.
3. Pascal Fradet and Daniel Le Métayer. Structured Gamma. Science of Computer Programming, 31(2-3):263-289, 1998.
4. John Glauert, Richard Kennaway, and Ronan Sleep: Dactl: An experimental graph rewriting language. In Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 378-395. Springer-Verlag, 1991.
5. Annegret Habel, Jürgen Müller, Detlef Plump. Double-pushout graph transformation revisited. Bericht Nr. 7/99, Fachbereich Informatik, Universität Oldenburg, 1999. Revised version to appear in Mathematical Structures in Computer Science.
6. Harry R. Lewis and Christos H.: Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, second edition, 1998.
7. Peter J. Rodgers. A graph rewriting programming language for graph drawing. In Proc. 14th IEEE Symposium on Visual Languages. IEEE Computer Society Press, 1998.
8. Andy Schürr, Andreas Winter, and Albert Zündorf. The PROGRES approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 13, 487-550. World Scientific, 1999.
9. Tadahiro Uesu. A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba J. Math. 2, 11-26, 1978.
10. Klaus Weihrauch. Computability. Volume 9 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.