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

Research output: Contribution to journalArticleResearchpeer-review

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 languageEnglish
Pages (from-to)271-281
Number of pages11
JournalActa Mathematica Hungarica
Volume151
Issue number2
DOIs
Publication statusPublished - 1 Apr 2017

Fingerprint

Word problem
Disjoint
Union
Semigroup
Natural number
Efficient Algorithms

Keywords

  • decidability
  • membership problem
  • semigroup
  • word problem

Cite this

@article{8030e3270d034af986768b87e6c6f654,
title = "Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup",
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.",
keywords = "decidability, membership problem, semigroup, word problem",
author = "N. Abughazalah",
year = "2017",
month = "4",
day = "1",
doi = "10.1007/s10474-017-0687-5",
language = "English",
volume = "151",
pages = "271--281",
journal = "Acta Mathematica Hungarica",
issn = "0236-5294",
publisher = "Springer Netherlands",
number = "2",

}

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 -