KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES

DOI10.1142/S0218196700000352zbMath1030.20023arXivmath/0001035MaRDI QIDQ4786262

Paul J. Sanders, David B. A. Epstein

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0001035

zbMATH Keywords

finitely presented groupsregular languagesautomatic groupsfinite state automatasolvable word problemKnuth-Bendix proceduresword reductions

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Related Items (1)

ON CERTAIN PAIRS OF NON-ENGEL ELEMENTS IN FINITE GROUPS

Uses Software

• kbmag

Cites Work

• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Infinite regular Thue systems

This page was built for publication: KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES