On tree automata that certify termination of left-linear term rewriting systems

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput., 205(4):512-534, 2007. [doi]

@article{GeserHWZ07,
  title = {On tree automata that certify termination of left-linear term rewriting systems},
  author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  year = {2007},
  doi = {10.1016/j.ic.2006.08.007},
  url = {http://dx.doi.org/10.1016/j.ic.2006.08.007},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GeserHWZ07},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {205},
  number = {4},
  pages = {512-534},
}