Steinbach, J. (1991). Termination proofs of rewriting systems: Heuristics for generating polynomial orderings. Fachbereich Informatik, Univ. Kaiserslautern.
Chicago Style (17th ed.) CitationSteinbach, Joachim. Termination Proofs of Rewriting Systems: Heuristics for Generating Polynomial Orderings. Kaiserslautern: Fachbereich Informatik, Univ. Kaiserslautern, 1991.
MLA (9th ed.) CitationSteinbach, Joachim. Termination Proofs of Rewriting Systems: Heuristics for Generating Polynomial Orderings. Fachbereich Informatik, Univ. Kaiserslautern, 1991.
Warning: These citations may not always be 100% accurate.