The use of Knuth-Bendix methods to solve the word problem in automatic groups

DOI10.1016/S0747-7171(08)80093-4zbMath0779.20017MaRDI QIDQ1192222

S. E. Rees, Derek F. Holt, David B. A. Epstein

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

normal formHNN extensionsfree productsautomatic groupsfinitely presentedsolvable word problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (19)

KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES ⋮ The Development of the Theory of Automatic Groups ⋮ Experiments on growth series of braid groups ⋮ Infinite complete group presentations ⋮ Growth Functions and Automatic Groups ⋮ Efficiency issues in the KBMAG procedure ⋮ An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite ⋮ Some experiments with a completion theorem prover ⋮ Theorem proving with group presentations: Examples and questions ⋮ ON CERTAIN PAIRS OF NON-ENGEL ELEMENTS IN FINITE GROUPS ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group ⋮ Detecting Negative Curvature in Groups Via Local Conditions ⋮ Automatic Groups Associated with Word Orders Other than Shortlex ⋮ Commensurating HNN extensions: nonpositive curvature and biautomaticity ⋮ Biautomatic structures in systolic Artin groups ⋮ Search problems in groups and branching processes ⋮ Automatic semigroups ⋮ GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE ⋮ Regular Gröbner bases

Cites Work

• The combinatorial structure of cocompact discrete hyperbolic groups
• A catalogue of complete group presentations
• Systems of reductions
• Presentations of groups and monoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The use of Knuth-Bendix methods to solve the word problem in automatic groups