On regularity and the word problem for free idempotent generated semigroups
From MaRDI portal
Publication:5357382
DOI10.1112/plms.12011zbMath1434.20039arXiv1412.5167OpenAlexW3126116132MaRDI QIDQ5357382
Robert D. Gray, Igor Dolinka, Nikola Ruškuc
Publication date: 15 September 2017
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5167
Combinatorics in computer science (68R05) General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Free idempotent generated semigroups: subsemigroups, retracts and maximal subgroups, Idempotents and one-sided units: lattice invariants and a semigroup of functors on the category of monoids, Regular semigroups weakly generated by idempotents, A groupoid approach to regular \(\ast \)-semigroups, On the structure of semigroups whose regular elements are completely regular, A group-theoretical interpretation of the word problem for free idempotent generated semigroups, Ehresmann theory and partition monoids, Structure theory of regular semigroups, Idempotents and one-sided units in infinite partial Brauer monoids, Free idempotent generated semigroups: the word problem and structure via gain graphs, Presentations for singular wreath products, Elaborating the word problem for free idempotent-generated semigroups over the full transformation monoid, The Mathematical Work of K. S. S. Nambooripad
