Weighted Automata for Proving Termination of String Rewriting

Johannes Waldmann. Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics, 12(4):545-570, 2007.

@article{Waldmann07,
  title = {Weighted Automata for Proving Termination of String Rewriting},
  author = {Johannes Waldmann},
  year = {2007},
  tags = {termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Waldmann07},
  cites = {0},
  citedby = {0},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume = {12},
  number = {4},
  pages = {545-570},
}