A catalogue of complete group presentations

Authors:
Philippe Le Chenadec
Affiliations:
INRIA, 78150 Le Chesnay, France
Venue:
Journal of Symbolic Computation
Year:
1986

Citing 2
Cited 2

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems

Journal of the ACM (JACM)

A test for λ-confluence for certain prefix rewriting systems with applications to the generalized word problem

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
The use of Knuth-Bendix methods to solve the wordproblem in automatic groups

Journal of Symbolic Computation - Special issue on computational group theory: part 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

A complete group presentation consists of a set of generators and a set of replacement rules generating a well-founded and confluent relation on words, thereby solving the word problem for this presentation. Complete presentations for surface, Coxeter, Dyck and symmetric groups are discussed. These complete presentations possess interesting combinatorial properties and provide uniform algorithms for the word problem.