Logged Rewriting Procedures with Application to Identities Among Relations

arXivmath/9907082MaRDI QIDQ6501402FDOQ6501402

Abstract: The key idea is that rewriting procedures can be enhanced so that they not only rewrite words but record (log) how the rewriting has taken place. We introduce logged rewrite systems and present a variation on the Knuth-Bendix algorithm for obtaining (where possible) complete logged rewrite systems. This procedure is then applied to work of Brown and Razak Salleh, and an algorithm is developed which provides a set of generators for the module of identities among relations of a group presentation.

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Resolutions; derived functors (category-theoretic aspects) (18G10)

This page was built for publication: Logged Rewriting Procedures with Application to Identities Among Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501402)