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

N. Abughazalah

doi:10.1007/s10474-017-0687-5

Back

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

Journal article

Peer reviewed

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

N. Abughazalah

Acta mathematica Hungarica, Vol.151(2), pp.271-281

01/04/2017

DOI: https://doi.org/10.1007/s10474-017-0687-5

Abstract

Mathematics

Physical Sciences

Science & Technology

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.

Metrics

1 Record Views

Details

Title: Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup
Creators - without role: N. Abughazalah - Princess Nourah bint Abdulrahman University
Publication Details: Acta mathematica Hungarica, Vol.151(2), pp.271-281
Publisher: Springer Nature
Number of pages: 11
Grant note: Princess Nourah bint Abdulrahman University in Riyadh; Princess Nourah bint Abdulrahman University Saudi Aramco Ibn Khaldun Fellowship for Saudi Women Center for Clean Water and Clean Energy at MIT
Identifiers: 9927647808331
Academic Unit: Princess Nourah bint Abdulrahman University
Language: English
Resource Type: Journal article