The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
DOI10.2977/PRIMS/1195167732zbMATH Open0806.20028OpenAlexW2010988415MaRDI QIDQ1328892FDOQ1328892
Authors: Chuya Hayashi
Publication date: 15 February 1995
Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2977/prims/1195167732
Recommendations
- KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES
- Efficient solution of the word problem in slim varieties
- A completion procedure for finitely presented groups that is based on word cycles
- The use of Knuth-Bendix methods to solve the word problem in automatic groups
- scientific article; zbMATH DE number 3918657
algorithmCayley graphword problemhyperbolic groupsfinite state automatonfinite presentationsKnuth-Bendix algorithmfinite group presentationconfluent set of relationsregular confluent set of relations
Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
Cited In (4)
This page was built for publication: The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328892)