### Abstract

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has soluble word problem and soluble membership problem. Efficient algorithms are given for both problems.

Original language | English |
---|---|

Pages (from-to) | 271-281 |

Number of pages | 11 |

Journal | Acta Mathematica Hungarica |

Volume | 151 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Apr 2017 |

### Fingerprint

### Keywords

- decidability
- membership problem
- semigroup
- word problem

### Cite this

}

**Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup.** / Abughazalah, N.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup

AU - Abughazalah, N.

PY - 2017/4/1

Y1 - 2017/4/1

N2 - Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has soluble word problem and soluble membership problem. Efficient algorithms are given for both problems.

AB - Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has soluble word problem and soluble membership problem. Efficient algorithms are given for both problems.

KW - decidability

KW - membership problem

KW - semigroup

KW - word problem

UR - http://www.scopus.com/inward/record.url?scp=85014116716&partnerID=8YFLogxK

U2 - 10.1007/s10474-017-0687-5

DO - 10.1007/s10474-017-0687-5

M3 - Article

VL - 151

SP - 271

EP - 281

JO - Acta Mathematica Hungarica

JF - Acta Mathematica Hungarica

SN - 0236-5294

IS - 2

ER -