Searching for "Termination of Graph Rewriting is Undecidable." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Termination Of Graph Rewriting Is Undecidable
by Detlef Plump — 1998
… of string rewriting systems is undecidable. In the present paper, it is shown that termination of graph…
Cited by 6 (1 self) – Add To MetaCart

Termination of HighLevel Replacement Units with Application to Model Transformation
by Paolo Bottoni, Manuel Koch, Francesco Parisi-presicce, Gabriele Taentzer C — 2004 — In proceedings of VLFM’04, ENTCS
… in [16], that termination of graph rewriting is undecidable in general, they provide some intuitive…
Cited by 4 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB