2000 character limit reached
Inverse semigroups with rational word problem are finite
Published 15 Nov 2013 in math.GR and cs.FL | (1311.3955v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.