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

DOI10.1007/s10474-017-0687-5zbMath1399.20057arXiv1503.06818OpenAlexW2559985756MaRDI QIDQ1701408

Nabilah Abughazalah

Publication date: 22 February 2018

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06818

zbMATH Keywords

semigroupword problemdecidabilitymembership problem

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Cites Work

• On disjoint unions of finitely many copies of the free monogenic semigroup.
• A classification of disjoint unions of two or three copies of the free monogenic semigroup.
• Finitely approximable regular semigroups
• On generators and relations for unions of semigroups
• Unnamed Item
• Unnamed Item