𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using string-rewriting for solving the word problem for finitely presented groups

✍ Scribed by Klaus Madlener; Friedrich Otto

Book ID
113163074
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
285 KB
Volume
24
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The word problem for geometrically finit
The word problem for geometrically finite groups
✍ W. J. Floyd; A. H. M. Hoare; R. C. Lyndon πŸ“‚ Article πŸ“… 1986 πŸ› Springer 🌐 English βš– 359 KB

This note is based on J. W. Cannon's paper [2], in which he gives, among other things, a solution of the word problem for cocompact groups of isometrics of hyperbolic space of dimension d >1 1. We have thought it worthwhile to show how Cannon's ideas can be rearranged to give a rather simple solutio

Solving the Word Problem for Two Classes
Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting
✍ Alfred Widiger πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 234 KB

Using the notion of modified completion given in Widiger, A. (1998, Deciding degreefour-identities for alternative rings by rewriting. In Bronstein, M., Grabmeier, J., Weispfenning, V. eds, Symbolic Rewriting Techniques, PCS 15, pp. 277-288. BirkhΓ€user-Verlag), it is shown that the word problem for

A New Algorithm for Solving the Word Pro
A New Algorithm for Solving the Word Problem in Braid Groups
✍ D. Garber; S. Kaplan; M. Teicher πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi