The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm

DOI10.2977/PRIMS/1195167732zbMath0806.20028OpenAlexW2010988415MaRDI QIDQ1328892

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

zbMATH Keywords

algorithmCayley graphword problemhyperbolic groupsfinite state automatonfinite presentationsKnuth-Bendix algorithmfinite group presentationconfluent set of relationsregular confluent set of relations

Mathematics Subject Classification ID

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

• Presentations of groups and monoids
• Optimization of LR(k) parsers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm