Efficiency issues in the kbmag procedure

https://doi.org/10.1016/j.jlap.2010.11.001Get rights and content
Under an Elsevier user license
open archive

Abstract

A well-known computational approach to finite presentations of infinite groups is the kbmag procedure of Epstein, Holt and Rees. We describe some efficiency issues relating to the procedure and detail two asymptotic improvements: an index for the rewriting system that uses generalized suffix trees and the use of dynamic programming to reduce the number of verification steps.

MSC 2000

Primary 08-04
Secondary 68-04

Keywords

Knuth–Bendix algorithm
Automatic groups
String rewriting

Cited by (0)