Knuth-Bendix for groups with infinitely many rules

Simple item page
dc.creatorEpstein, D. B. A.
dc.creatorSanders, P. J.
dc.date2000-01-06
dc.date.accessioned2026-07-07T04:33:14Z
dc.date.available2026-07-07T04:33:14Z
dc.descriptionIt is shown how to use a small finite state automaton in two variables in order to carry out the Knuth-Bendix process for rewriting words in a group in shortlex order. The two-variable automaton can be used to store an infinite set of rules and to carry out fast reduction of arbitrary words using this infinite set. We introduce a new operation, which we call welding, which applies to an arbitrary finite state automaton. We show how to improve on the standard subset construction to determinize a non-deterministic automaton under special conditions which hold in our situation.
dc.description63 pages, 6 figures. A completely rewritten version of math/9805057. A slightly shortened version of this paper has been accepted by IJAC
dc.identifierhttps://arxiv.org/abs/math/0001035
dc.identifierhttp://arxiv.org/abs/math/0001035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58497
dc.subjectGroup Theory
dc.subject20F10,20-04,68Q42 (Primary); 03D40,20F32 (Secondary)
dc.titleKnuth-Bendix for groups with infinitely many rules
dc.typetext

Files

Collections

arXiv