Using groups for investigating rewrite systems

DOI10.1017/S0960129508007160zbMath1157.03015OpenAlexW1989572478MaRDI QIDQ3545275

Vincent van Oostrom, Patrick Dehornoy

Publication date: 10 December 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007160

zbMATH Keywords

word problemrewrite systemsequational specificationlocal confluencemonoid of partial maps

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)

Related Items (1)

The braid shelf

Cites Work

• Unnamed Item
• Thue systems as rewriting systems
• How to decide the lark
• Complete positive group presentations.
• Study of an identity.
• The structure group for the associativity identity
• The group of parenthesized braids.
• Geometric presentations for Thompson's groups.
• FREE AUGMENTED LD-SYSTEMS
• Theorem-Proving on the Computer
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Structural Monoids Associated to Equational Varieties
• Term Rewriting and All That
• THE ALGEBRA OF STRAND SPLITTING II: A PRESENTATION FOR THE BRAID GROUP ON ONE STRAND

This page was built for publication: Using groups for investigating rewrite systems