Inverse semigroups with rational word problem are finite
From MaRDI portal
Abstract: This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word problem -- the set of all pairs of words over a generating set for the semigroup which both represent the same element.
This page was built for publication: Inverse semigroups with rational word problem are finite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6246513)
