Kruskal's Tree Theorem for Acyclic Term Graphs

@inproceedings{Moser2016KruskalsTT,
  title={Kruskal's Tree Theorem for Acyclic Term Graphs},
  author={Georg Moser and Maria Anna Schett},
  booktitle={TERMGRAPH},
  year={2016}
}
  • Georg Moser, Maria Anna Schett
  • Published in TERMGRAPH 2016
  • Mathematics, Computer Science
  • In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For this we adapt the homeomorphic embedding relation to term graphs. In contrast to earlier extensions, our notion is inspired by morphisms. Based on this, we establish a variant of Kruskal's Tree Theorem formulated for acyclic term graphs. In proof, we rely on… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES
    Simplification Orders for Term Graph Rewriting
    12
    Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
    9
    Complexity of Acyclic Term Graph Rewriting
    2
    Termination Analysis for Graph Transformation Systems
    20
    Non-simplifying Graph Rewriting Termination
    7
    Orderings for Term-Rewriting Systems
    471
    Orderings for term-rewriting systems
    303
    Term Graph Rewriting
    124
    Term Graph Rewriting
    218
    On well-quasi-ordering finite trees
    250