Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Johannes Waldmann. Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics, 12(4):545-570, 2007.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi] Finding finite automata that certify termination of string rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. ijfcs, 16(3):471-486, 2005. [doi] Termination of String Rewriting with Matrix InterpretationsDieter Hofbauer, Johannes Waldmann. RTA 2006: 328-342 [doi]
The following publications are possibly variants of this publication: