Reduction relations for monoid semirings

Friedrich Otto; Olga Sokratova

doi:10.1016/j.jsc.2003.07.002

Back

Reduction relations for monoid semirings

Journal article

Open access

Peer reviewed

Reduction relations for monoid semirings

Friedrich Otto and Olga Sokratova

Journal of symbolic computation, Vol.37(3), pp.343-376

03/2004

DOI: 10.1016/j.jsc.2003.07.002

Files and links (1)

url

https://doi.org/10.1016/j.jsc.2003.07.002View

Published (Version of record) Open Access

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.

Reduction relation

Congruence

Critical pair

Confluence

Semiring

Termination

Rewriting system

Details

Title: Subtitle: Reduction relations for monoid semirings
Creators: Friedrich Otto - Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany
Olga Sokratova - Institute of Computer Science, University of Tartu, Liivi 2, 50409 Tartu, Estonia
Resource Type: Journal article
Publication Details: Journal of symbolic computation, Vol.37(3), pp.343-376
DOI: 10.1016/j.jsc.2003.07.002
ISSN: 0747-7171
eISSN: 1095-855X
Publisher: Elsevier Ltd
Language: English
Date published: 03/2004
Academic Unit: Mathematics
Record Identifier: 9983985865502771

Metrics

11 Record Views

2 Times Cited - Web of Science