Rewriting in Varieties of Idempotent Semigroups

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F11%3A00050146" target="_blank" >RIV/00216224:14310/11:00050146 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-21493-6_12" target="_blank" >http://dx.doi.org/10.1007/978-3-642-21493-6_12</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-21493-6_12" target="_blank" >10.1007/978-3-642-21493-6_12</a>

Result language

angličtina

Original language name

Rewriting in Varieties of Idempotent Semigroups

Original language description

We consider rewriting as a tool for solving identity problems in varieties of idempotent semigroups. It is known that there exist finite canonical term rewrite systems and finite canonical word rewrite systems for only a very limited number of those varieties. We present a finite canonical conditional word rewrite system for a particular variety in which the classical approaches cannot be applied. Moreover, we obtain infinite single letter deleting rewrite systems for each join-irreducible variety.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Algebraic Informatics

ISBN

978-3-642-21492-9

ISSN

0302-9743

e-ISSN

—

Number of pages

16

Pages from-to

185-200

Publisher name

Springer

Place of publication

Berlin

Event location

Linz

Event date

Jan 1, 2011

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—