↓ Skip to main content

Rewriting Techniques and Applications

Overview of attention for book
Cover of 'Rewriting Techniques and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Term-rewriting implementation of equational logic programming
  3. Altmetric Badge
    Chapter 2 Optimizing equational programs
  4. Altmetric Badge
    Chapter 3 A compiler for conditional term rewriting systems
  5. Altmetric Badge
    Chapter 4 How to choose the weights in the Knuth Bendix ordering
  6. Altmetric Badge
    Chapter 5 Detecting looping simplifications
  7. Altmetric Badge
    Chapter 6 Combinatorial hypermap rewriting
  8. Altmetric Badge
    Chapter 7 The word problem for finitely presented monoids and finite canonical rewriting systems
  9. Altmetric Badge
    Chapter 8 Term rewriting systems with priorities
  10. Altmetric Badge
    Chapter 9 A gap between linear and non linear term-rewriting systems
  11. Altmetric Badge
    Chapter 10 Code generator generation based on template-driven target term rewriting
  12. Altmetric Badge
    Chapter 11 Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction
  13. Altmetric Badge
    Chapter 12 Groups presented by certain classes of finite length-reducing string-rewriting systems
  14. Altmetric Badge
    Chapter 13 Some results about confluence on a given congruence class
  15. Altmetric Badge
    Chapter 14 Ground confluence
  16. Altmetric Badge
    Chapter 15 Structured contextual rewriting
  17. Altmetric Badge
    Chapter 16 Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes
  18. Altmetric Badge
    Chapter 17 Completion for rewriting modulo a congruence
  19. Altmetric Badge
    Chapter 18 On equational theories, unification and decidability
  20. Altmetric Badge
    Chapter 19 A general complete E -unification procedure
  21. Altmetric Badge
    Chapter 20 Improving basic narrowing techniques
  22. Altmetric Badge
    Chapter 21 Strategy-controlled reduction and narrowing
  23. Altmetric Badge
    Chapter 22 Algorithmic complexity of term rewriting systems
  24. Altmetric Badge
    Chapter 23 Optimal speedups for parallel pattern matching in trees
Attention for Chapter 7: The word problem for finitely presented monoids and finite canonical rewriting systems
Altmetric Badge

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The word problem for finitely presented monoids and finite canonical rewriting systems
Chapter number 7
Book title
Rewriting Techniques and Applications
Published by
Springer, Berlin, Heidelberg, May 1987
DOI 10.1007/3-540-17220-3_7
Book ISBNs
978-3-54-017220-8, 978-3-54-047421-0
Authors

Craig Squier, Friedrich Otto, Squier, Craig, Otto, Friedrich

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Malaysia 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Doctoral Student 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Philosophy 1 50%
Medicine and Dentistry 1 50%