Termination of Graph Rewriting is Undecidable

Fundamenta Informaticae

Volumn 33, Issue 2, 1998, Pages 201-209

  Plump, Detlef ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Graph rewriting; Post Correspondence Problem; Termination

Indexed keywords

EID: 0009399483     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-33204     Document Type: Article

References (7)

1. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel, and Michael Löwe. Algebraic approaches to graph transformation - Part I. Basic concepts and double pushout approach. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 3, pages 163-245. World Scientific, 1997.
2. 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, pages 1-69. Springer-Verlag, 1979.
3. Maria C.F. Ferreira. Termination of term rewriting. Dissertation, Universiteit Utrecht, Faculteit Wiskunde en Informatica, 1995.
4. Gérard Huet and Dallas Lankford. On the uniform halting problem for term rewriting systems. Report no. 283, INRIA Rocquencourt, 1978.
5. Pierre Lescanne. On termination of one rule rewrite systems. Theoretical Computer Science, 132:395-401, 1994.
6. Grzegorz Rozenberg and Arto Salomaa. Cornerstones of Undecidability. Prentice Hall, 1994.
7. Hans Zantema. Total termination of term rewriting is undecidable. Journal of Symbolic Computation, 20:43-60, 1995.