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
finitely presented groups; regular languages; automatic groups; finite state automata; solvable word problem; Knuth-Bendix procedures; word reductions
20F05: Generators, relations, and presentations of groups
20F65: Geometric group theory
68Q42: Grammars and rewriting systems
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
03D40: Word problems, etc. in computability and recursion theory
Related Items
Uses Software
Cites Work