Weights for total division orderings on strings
From MaRDI portal
Publication:1346630
DOI10.1016/0304-3975(94)90111-2zbMath0829.68074OpenAlexW1984553083MaRDI QIDQ1346630
Publication date: 6 April 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90111-2
Related Items (4)
Theorem proving with group presentations: Examples and questions ⋮ On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting ⋮ Weight ideals associated to regular and log-linear arrays. ⋮ Invariants, patterns and weights for ordering terms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Verifying nilpotence
- Orderings for term-rewriting systems
- A note on division orderings on strings
- Some undecidability results for non-monadic Church-Rosser Thue systems
- Termination of rewriting
- Thue systems as rewriting systems
- Rationality of division orderings
- Finite canonical rewriting systems for congruences generated by concurrency relations
- An Early Program Proof by Alan Turing
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Weights for total division orderings on strings
