Login / Signup
Termination of Graph Rewriting is Undecidable.
Detlef Plump
Published in:
Fundam. Informaticae (1998)
Keyphrases
</>
rewriting systems
termination analysis
graph structure
datalog programs
graph model
bipartite graph
connected components
rewriting rules
weighted graph
graph theoretic
graph representation
graph databases
directed graph
random walk
spanning tree
knn
rewrite rules
regular path queries
sufficient conditions