Inverse semigroups with rational word problem are finite
Group Theory
2013-11-18 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1311.3955,
title = {Inverse semigroups with rational word problem are finite},
author = {Tara Brough},
journal= {arXiv preprint arXiv:1311.3955},
year = {2013}
}
Comments
6 pages, no figures