VOLUME 12 2007 NUMBER 4
Weighted Automata for Proving Termination of String Rewriting
Johannes Waldmann
Pages 545–570



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2007-545,
  author  = {Johannes Waldmann},
  title   = {Weighted Automata for Proving Termination of String Rewriting},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {4},
  pages   = {545--570},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-545},
  doi     = {10.25596/jalc-2007-545}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: weighted automata, termination, string rewriting, well-founded semi-rings, monotone algebra
DOI: 10.25596/jalc-2007-545