On the theory of graded structures
Journal of Symbolic Computation
Journal of Symbolic Computation
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Journal of Symbolic Computation
Extension functions for multiset orderings
Information Processing Letters
Journal of Symbolic Computation
About the descriptive power of certain classes of finite string-rewriting systems
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
A geometrical approach to multiset orderings
Theoretical Computer Science
Automating the Knuth Bendix ordering
Acta Informatica
A note on division orderings on strings
Information Processing Letters
Divergence phenomena during completion
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Monomial orderings and Gröbner bases
ACM SIGSAM Bulletin
String-rewriting systems
The use of Knuth-Bendix methods to solve the wordproblem in automatic groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Rationality of division orderings
Information Processing Letters
Proving termination with multiset orderings
Communications of the ACM
Linear Interpretations by Counting Patterns
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Ordered Rewriting and Confluence
Proceedings of the 10th International Conference on Automated Deduction
Polynomial Interpretations and the Complexity of Algorithms
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
We describe two new families of orderings on words, and show that each has continuum many distinct members.