Sign in
Infinite String Rewrite Systems and Complexity
Journal article   Open access  Peer reviewed

Infinite String Rewrite Systems and Complexity

Jean-Camille Birget
Journal of symbolic computation, Vol.25(6), pp.759-793
06/1998

Abstract

We study the relation between time complexity and derivation work for the word problem of infinitely presented semigroups and groups. We introduce the notion of theworkof a derivation (defined as the sum of the lengths of all the rules used in the derivation, with multiplicity). The following results are proved:
url
https://doi.org/10.1006/jsco.1997.0198View
Version of Record (VoR) Open

Metrics

Details