Titlebook: ;

magnanimity

https://doi.org/10.1007/978-3-662-63330-4lish that a graph language can be decided by a system which is confluent up to garbage. We present two case studies with backtracking-free graph reduction systems which recognise a class of flow diagrams and a class of labelled series-parallel graphs, respectively. Both systems are non-confluent but