A rst explicit connection between nitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution to the word problem in commutative monoids byâ€¦ (More)

The concept of algebraic simpliication is of great importance for the eld of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings inâ€¦ (More)

Following Buchbergerâ€™s approach to computing a Grobner basis of a polynomial ideal in polynomial rings, a completion procedure for finitely generated right ideals in Z[â€™H] is given, where â€˜1-l is anâ€¦ (More)

In this thesis, di erent techniques for performing retrieval, adaptation and learning will be presented and integrated in the case-based planner CAPlan/CbC. The main purpose of this thesis is toâ€¦ (More)

The comp!exity of some classical algorithmic problems in free groups is studied. Problems like the genctralized word problem, to determine shortest coset representatives, to decide whether twoâ€¦ (More)

Applicable Algebra in Engineering, Communicationâ€¦

1994

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have beenâ€¦ (More)

A pseudc-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1â€¦ (More)

Does every automatic group have a presentation through some finite convergent string-rewriting system? Does every automatic monoid have an automatic structure such that the set of representatives isâ€¦ (More)