Using groups for investigating rewrite systems
DOI10.1017/S0960129508007160zbMATH Open1157.03015OpenAlexW1989572478MaRDI QIDQ3545275FDOQ3545275
Authors: Patrick Dehornoy, Vincent van Oostrom 
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
Recommendations
- scientific article; zbMATH DE number 1222454
- Applying term rewriting methods to finite groups
- Publication:4939199
- Finite complete rewriting systems for groups
- scientific article; zbMATH DE number 4210420
- scientific article; zbMATH DE number 4088915
- Rewriteability in Finite Groups
- scientific article; zbMATH DE number 4083918
- Rewriting Systems and Embedding of Monoids in Groups
- Rewrite systems for varieties of semigroups
Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)
Cites Work
- Geometric presentations for Thompson's groups.
- Term Rewriting and All That
- The group of parenthesized braids.
- THE ALGEBRA OF STRAND SPLITTING II: A PRESENTATION FOR THE BRAID GROUP ON ONE STRAND
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Theorem-Proving on the Computer
- Complete positive group presentations.
- Thue systems as rewriting systems
- The structure group for the associativity identity
- Structural Monoids Associated to Equational Varieties
- Study of an identity.
- How to decide the lark
- FREE AUGMENTED LD-SYSTEMS
Cited In (4)
This page was built for publication: Using groups for investigating rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545275)
