Reduction relations for monoid semirings

Authors:
Friedrich Otto;Olga Sokratova
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany;Institute of Computer Science, University of Tartu, Liivi 2, 50409 Tartu, Estonia
Venue:
Journal of Symbolic Computation
Year:
2004

Citing 8
Cited 0

On an installation of Buchberger's algorithm

Journal of Symbolic Computation
Termination proofs by multiset path orderings imply primitive recursive derivation lengths

Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Term rewriting and all that

Term rewriting and all that
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

Theoretical Computer Science - Special issue on rewriting techniques and applications
Proving termination with multiset orderings

Communications of the ACM
The Mal'cev Lemma and rewriting on semirings

Theoretical Computer Science
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

Theoretical Computer Science
Groebner Bases for Non-Commutative Polynomial Rings

AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study rewriting techniques for monoid semirings. Based on disjoint and non-disjoint representations of the elements of monoid semirings we define two different reduction relations. We prove that in both cases the reduction relation describes the congruence that is induced by the underlying set of equations, and we study the termination and confluence properties of the reduction relations.